./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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.vis_QF_BV_s1269b_p1.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 de940fca6d64eccb0c65ba196c7e2e2564d42ad4ccc15ff447c131480f1f19c9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:54:21,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:54:21,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:54:21,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:54:21,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:54:21,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:54:21,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:54:21,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:54:21,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:54:21,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:54:21,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:54:21,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:54:21,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:54:21,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:54:21,400 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:54:21,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:54:21,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:54:21,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:54:21,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:54:21,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:54:21,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:54:21,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:54:21,402 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:54:21,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:54:21,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:54:21,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:54:21,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:54:21,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:54:21,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:54:21,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:54:21,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:54:21,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:54:21,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:54:21,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:54:21,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:54:21,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:54:21,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:54:21,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:54:21,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:54:21,405 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 -> de940fca6d64eccb0c65ba196c7e2e2564d42ad4ccc15ff447c131480f1f19c9 [2024-11-12 00:54:21,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:54:21,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:54:21,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:54:21,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:54:21,667 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:54:21,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p1.c [2024-11-12 00:54:22,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:54:23,207 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:54:23,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p1.c [2024-11-12 00:54:23,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340b0b6fa/98633d6b7a6248a79288be8c6b729b93/FLAGdf62f5765 [2024-11-12 00:54:23,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340b0b6fa/98633d6b7a6248a79288be8c6b729b93 [2024-11-12 00:54:23,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:54:23,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:54:23,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:54:23,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:54:23,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:54:23,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:54:23" (1/1) ... [2024-11-12 00:54:23,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3949c2ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:23, skipping insertion in model container [2024-11-12 00:54:23,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:54:23" (1/1) ... [2024-11-12 00:54:23,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:54:23,724 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.vis_QF_BV_s1269b_p1.c[1259,1272] [2024-11-12 00:54:23,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:54:23,982 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:54:23,997 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.vis_QF_BV_s1269b_p1.c[1259,1272] [2024-11-12 00:54:24,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:54:24,109 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:54:24,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:24 WrapperNode [2024-11-12 00:54:24,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:54:24,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:54:24,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:54:24,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:54:24,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:24" (1/1) ... [2024-11-12 00:54:24,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:24" (1/1) ... [2024-11-12 00:54:24,288 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2116 [2024-11-12 00:54:24,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:54:24,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:54:24,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:54:24,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:54:24,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:24" (1/1) ... [2024-11-12 00:54:24,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:24" (1/1) ... [2024-11-12 00:54:24,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:24" (1/1) ... [2024-11-12 00:54:24,406 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 00:54:24,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:24" (1/1) ... [2024-11-12 00:54:24,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:24" (1/1) ... [2024-11-12 00:54:24,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:24" (1/1) ... [2024-11-12 00:54:24,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:24" (1/1) ... [2024-11-12 00:54:24,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:24" (1/1) ... [2024-11-12 00:54:24,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:24" (1/1) ... [2024-11-12 00:54:24,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:54:24,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:54:24,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:54:24,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:54:24,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:24" (1/1) ... [2024-11-12 00:54:24,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:54:24,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:54:24,759 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-12 00:54:24,764 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-12 00:54:24,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:54:24,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:54:24,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:54:24,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:54:24,979 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:54:24,981 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:54:26,959 INFO L? ?]: Removed 1281 outVars from TransFormulas that were not future-live. [2024-11-12 00:54:26,959 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:54:26,979 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:54:26,979 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:54:26,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:54:26 BoogieIcfgContainer [2024-11-12 00:54:26,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:54:26,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:54:26,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:54:26,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:54:26,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:54:23" (1/3) ... [2024-11-12 00:54:26,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6268e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:54:26, skipping insertion in model container [2024-11-12 00:54:26,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:24" (2/3) ... [2024-11-12 00:54:26,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6268e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:54:26, skipping insertion in model container [2024-11-12 00:54:26,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:54:26" (3/3) ... [2024-11-12 00:54:26,989 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p1.c [2024-11-12 00:54:27,012 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:54:27,012 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:54:27,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:54:27,102 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;@20e23218, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:54:27,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:54:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 648 states, 646 states have (on average 1.5) internal successors, (969), 647 states have internal predecessors, (969), 0 states have call successors, (0), 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-12 00:54:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 00:54:27,112 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:27,116 INFO L218 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] [2024-11-12 00:54:27,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:27,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:27,123 INFO L85 PathProgramCache]: Analyzing trace with hash -725709712, now seen corresponding path program 1 times [2024-11-12 00:54:27,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:27,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154410360] [2024-11-12 00:54:27,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:27,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:27,713 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-12 00:54:27,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:27,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154410360] [2024-11-12 00:54:27,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154410360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:27,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:27,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:54:27,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763384935] [2024-11-12 00:54:27,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:27,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:54:27,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:27,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:54:27,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:54:27,753 INFO L87 Difference]: Start difference. First operand has 648 states, 646 states have (on average 1.5) internal successors, (969), 647 states have internal predecessors, (969), 0 states have call successors, (0), 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 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-12 00:54:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:27,835 INFO L93 Difference]: Finished difference Result 1241 states and 1859 transitions. [2024-11-12 00:54:27,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:54:27,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-11-12 00:54:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:27,853 INFO L225 Difference]: With dead ends: 1241 [2024-11-12 00:54:27,853 INFO L226 Difference]: Without dead ends: 647 [2024-11-12 00:54:27,857 INFO L434 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-12 00:54:27,860 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 0 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2883 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:27,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2883 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-12 00:54:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2024-11-12 00:54:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.4969040247678018) internal successors, (967), 646 states have internal predecessors, (967), 0 states have call successors, (0), 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-12 00:54:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 967 transitions. [2024-11-12 00:54:27,929 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 967 transitions. Word has length 51 [2024-11-12 00:54:27,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:27,929 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 967 transitions. [2024-11-12 00:54:27,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-12 00:54:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 967 transitions. [2024-11-12 00:54:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 00:54:27,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:27,931 INFO L218 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] [2024-11-12 00:54:27,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:54:27,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:27,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1020469140, now seen corresponding path program 1 times [2024-11-12 00:54:27,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:27,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726295883] [2024-11-12 00:54:27,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:27,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:28,197 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-12 00:54:28,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:28,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726295883] [2024-11-12 00:54:28,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726295883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:28,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:28,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:54:28,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489194439] [2024-11-12 00:54:28,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:28,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:54:28,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:28,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:54:28,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:54:28,204 INFO L87 Difference]: Start difference. First operand 647 states and 967 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-12 00:54:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:28,244 INFO L93 Difference]: Finished difference Result 1242 states and 1857 transitions. [2024-11-12 00:54:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:54:28,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-12 00:54:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:28,248 INFO L225 Difference]: With dead ends: 1242 [2024-11-12 00:54:28,248 INFO L226 Difference]: Without dead ends: 649 [2024-11-12 00:54:28,249 INFO L434 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-12 00:54:28,250 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 0 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:28,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2879 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-12 00:54:28,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2024-11-12 00:54:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.4953703703703705) internal successors, (969), 648 states have internal predecessors, (969), 0 states have call successors, (0), 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-12 00:54:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 969 transitions. [2024-11-12 00:54:28,265 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 969 transitions. Word has length 52 [2024-11-12 00:54:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:28,266 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 969 transitions. [2024-11-12 00:54:28,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-12 00:54:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 969 transitions. [2024-11-12 00:54:28,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 00:54:28,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:28,268 INFO L218 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] [2024-11-12 00:54:28,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:54:28,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:28,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:28,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1627229385, now seen corresponding path program 1 times [2024-11-12 00:54:28,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:28,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222736480] [2024-11-12 00:54:28,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:28,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:28,640 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-12 00:54:28,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:28,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222736480] [2024-11-12 00:54:28,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222736480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:28,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:28,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:54:28,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641574362] [2024-11-12 00:54:28,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:28,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:54:28,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:28,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:54:28,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:28,646 INFO L87 Difference]: Start difference. First operand 649 states and 969 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:28,775 INFO L93 Difference]: Finished difference Result 1372 states and 2046 transitions. [2024-11-12 00:54:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:54:28,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-12 00:54:28,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:28,778 INFO L225 Difference]: With dead ends: 1372 [2024-11-12 00:54:28,778 INFO L226 Difference]: Without dead ends: 777 [2024-11-12 00:54:28,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:54:28,781 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 223 mSDsluCounter, 4673 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 5627 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:28,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 5627 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:54:28,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-12 00:54:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 679. [2024-11-12 00:54:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 1.4926253687315634) internal successors, (1012), 678 states have internal predecessors, (1012), 0 states have call successors, (0), 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-12 00:54:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1012 transitions. [2024-11-12 00:54:28,797 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1012 transitions. Word has length 53 [2024-11-12 00:54:28,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:28,799 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1012 transitions. [2024-11-12 00:54:28,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:28,799 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1012 transitions. [2024-11-12 00:54:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 00:54:28,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:28,802 INFO L218 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] [2024-11-12 00:54:28,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:54:28,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:28,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash -186609517, now seen corresponding path program 1 times [2024-11-12 00:54:28,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:28,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450500667] [2024-11-12 00:54:28,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:29,065 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-12 00:54:29,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:29,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450500667] [2024-11-12 00:54:29,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450500667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:29,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:29,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 00:54:29,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835325347] [2024-11-12 00:54:29,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:29,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 00:54:29,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:29,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 00:54:29,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:54:29,068 INFO L87 Difference]: Start difference. First operand 679 states and 1012 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:29,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:29,184 INFO L93 Difference]: Finished difference Result 1374 states and 2046 transitions. [2024-11-12 00:54:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 00:54:29,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-12 00:54:29,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:29,186 INFO L225 Difference]: With dead ends: 1374 [2024-11-12 00:54:29,187 INFO L226 Difference]: Without dead ends: 779 [2024-11-12 00:54:29,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-12 00:54:29,188 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 224 mSDsluCounter, 6575 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 7527 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:29,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 7527 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:54:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-11-12 00:54:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 681. [2024-11-12 00:54:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 1.4911764705882353) internal successors, (1014), 680 states have internal predecessors, (1014), 0 states have call successors, (0), 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-12 00:54:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1014 transitions. [2024-11-12 00:54:29,197 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1014 transitions. Word has length 54 [2024-11-12 00:54:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:29,197 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1014 transitions. [2024-11-12 00:54:29,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1014 transitions. [2024-11-12 00:54:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-12 00:54:29,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:29,202 INFO L218 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] [2024-11-12 00:54:29,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:54:29,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:29,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:29,202 INFO L85 PathProgramCache]: Analyzing trace with hash 156684038, now seen corresponding path program 1 times [2024-11-12 00:54:29,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:29,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485608919] [2024-11-12 00:54:29,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:29,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:29,414 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-12 00:54:29,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:29,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485608919] [2024-11-12 00:54:29,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485608919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:29,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:29,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:54:29,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108151130] [2024-11-12 00:54:29,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:29,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:54:29,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:29,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:54:29,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:29,420 INFO L87 Difference]: Start difference. First operand 681 states and 1014 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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-12 00:54:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:29,520 INFO L93 Difference]: Finished difference Result 1532 states and 2279 transitions. [2024-11-12 00:54:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:54:29,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-12 00:54:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:29,523 INFO L225 Difference]: With dead ends: 1532 [2024-11-12 00:54:29,523 INFO L226 Difference]: Without dead ends: 928 [2024-11-12 00:54:29,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:54:29,524 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 442 mSDsluCounter, 4669 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 5620 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:29,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 5620 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:54:29,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2024-11-12 00:54:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 682. [2024-11-12 00:54:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.4889867841409692) internal successors, (1014), 681 states have internal predecessors, (1014), 0 states have call successors, (0), 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-12 00:54:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1014 transitions. [2024-11-12 00:54:29,533 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1014 transitions. Word has length 55 [2024-11-12 00:54:29,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:29,534 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1014 transitions. [2024-11-12 00:54:29,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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-12 00:54:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1014 transitions. [2024-11-12 00:54:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 00:54:29,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:29,535 INFO L218 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] [2024-11-12 00:54:29,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 00:54:29,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:29,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:29,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1161890658, now seen corresponding path program 1 times [2024-11-12 00:54:29,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:29,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971237344] [2024-11-12 00:54:29,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:29,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:29,717 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-12 00:54:29,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:29,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971237344] [2024-11-12 00:54:29,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971237344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:29,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:29,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:54:29,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552678085] [2024-11-12 00:54:29,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:29,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:54:29,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:29,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:54:29,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:29,719 INFO L87 Difference]: Start difference. First operand 682 states and 1014 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:29,809 INFO L93 Difference]: Finished difference Result 1542 states and 2291 transitions. [2024-11-12 00:54:29,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:54:29,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-12 00:54:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:29,813 INFO L225 Difference]: With dead ends: 1542 [2024-11-12 00:54:29,814 INFO L226 Difference]: Without dead ends: 933 [2024-11-12 00:54:29,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:54:29,820 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 448 mSDsluCounter, 4669 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 5620 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:29,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 5620 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:54:29,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-11-12 00:54:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 683. [2024-11-12 00:54:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 682 states have (on average 1.4868035190615836) internal successors, (1014), 682 states have internal predecessors, (1014), 0 states have call successors, (0), 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-12 00:54:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1014 transitions. [2024-11-12 00:54:29,835 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1014 transitions. Word has length 56 [2024-11-12 00:54:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:29,835 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1014 transitions. [2024-11-12 00:54:29,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1014 transitions. [2024-11-12 00:54:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-12 00:54:29,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:29,836 INFO L218 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] [2024-11-12 00:54:29,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 00:54:29,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:29,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:29,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1759476385, now seen corresponding path program 1 times [2024-11-12 00:54:29,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:29,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740800412] [2024-11-12 00:54:29,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:29,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:29,928 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-12 00:54:29,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:29,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740800412] [2024-11-12 00:54:29,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740800412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:29,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:29,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:54:29,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489078800] [2024-11-12 00:54:29,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:29,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:54:29,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:29,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:54:29,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:29,930 INFO L87 Difference]: Start difference. First operand 683 states and 1014 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:29,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:29,973 INFO L93 Difference]: Finished difference Result 1506 states and 2239 transitions. [2024-11-12 00:54:29,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:54:29,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-12 00:54:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:29,976 INFO L225 Difference]: With dead ends: 1506 [2024-11-12 00:54:29,976 INFO L226 Difference]: Without dead ends: 897 [2024-11-12 00:54:29,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:54:29,977 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 407 mSDsluCounter, 2784 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 3740 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:29,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 3740 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-11-12 00:54:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 676. [2024-11-12 00:54:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 675 states have (on average 1.4874074074074075) internal successors, (1004), 675 states have internal predecessors, (1004), 0 states have call successors, (0), 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-12 00:54:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1004 transitions. [2024-11-12 00:54:29,986 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1004 transitions. Word has length 57 [2024-11-12 00:54:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:29,986 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 1004 transitions. [2024-11-12 00:54:29,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1004 transitions. [2024-11-12 00:54:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-11-12 00:54:29,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:29,989 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:29,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 00:54:29,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:29,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1826871654, now seen corresponding path program 1 times [2024-11-12 00:54:29,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:29,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911434780] [2024-11-12 00:54:29,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:29,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:31,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:31,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911434780] [2024-11-12 00:54:31,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911434780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:31,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:31,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:54:31,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925673676] [2024-11-12 00:54:31,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:31,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:54:31,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:31,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:54:31,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:31,678 INFO L87 Difference]: Start difference. First operand 676 states and 1004 transitions. Second operand has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 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-12 00:54:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:31,727 INFO L93 Difference]: Finished difference Result 1367 states and 2037 transitions. [2024-11-12 00:54:31,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:54:31,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 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 349 [2024-11-12 00:54:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:31,731 INFO L225 Difference]: With dead ends: 1367 [2024-11-12 00:54:31,731 INFO L226 Difference]: Without dead ends: 772 [2024-11-12 00:54:31,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:31,733 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 94 mSDsluCounter, 2871 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:31,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 3831 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-12 00:54:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 770. [2024-11-12 00:54:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 1.4876462938881665) internal successors, (1144), 769 states have internal predecessors, (1144), 0 states have call successors, (0), 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-12 00:54:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1144 transitions. [2024-11-12 00:54:31,749 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1144 transitions. Word has length 349 [2024-11-12 00:54:31,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:31,750 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1144 transitions. [2024-11-12 00:54:31,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 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-12 00:54:31,750 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1144 transitions. [2024-11-12 00:54:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-12 00:54:31,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:31,755 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:31,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 00:54:31,756 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:31,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:31,757 INFO L85 PathProgramCache]: Analyzing trace with hash 71763880, now seen corresponding path program 1 times [2024-11-12 00:54:31,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:31,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805954917] [2024-11-12 00:54:31,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:31,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:33,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:33,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805954917] [2024-11-12 00:54:33,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805954917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:33,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:33,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:54:33,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882599838] [2024-11-12 00:54:33,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:33,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:54:33,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:33,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:54:33,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:33,811 INFO L87 Difference]: Start difference. First operand 770 states and 1144 transitions. Second operand has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 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-12 00:54:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:33,946 INFO L93 Difference]: Finished difference Result 1683 states and 2507 transitions. [2024-11-12 00:54:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:54:33,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 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 350 [2024-11-12 00:54:33,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:33,950 INFO L225 Difference]: With dead ends: 1683 [2024-11-12 00:54:33,950 INFO L226 Difference]: Without dead ends: 994 [2024-11-12 00:54:33,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:54:33,951 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 408 mSDsluCounter, 4681 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 5635 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:33,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 5635 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:54:33,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-11-12 00:54:33,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 787. [2024-11-12 00:54:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.4834605597964376) internal successors, (1166), 786 states have internal predecessors, (1166), 0 states have call successors, (0), 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-12 00:54:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1166 transitions. [2024-11-12 00:54:33,965 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1166 transitions. Word has length 350 [2024-11-12 00:54:33,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:33,965 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1166 transitions. [2024-11-12 00:54:33,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 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-12 00:54:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1166 transitions. [2024-11-12 00:54:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-12 00:54:33,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:33,969 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:33,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 00:54:33,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:33,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash -962093766, now seen corresponding path program 1 times [2024-11-12 00:54:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:33,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419141118] [2024-11-12 00:54:33,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:33,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:35,327 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:35,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:35,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419141118] [2024-11-12 00:54:35,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419141118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:35,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:35,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:54:35,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045312051] [2024-11-12 00:54:35,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:35,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:54:35,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:35,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:54:35,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:35,329 INFO L87 Difference]: Start difference. First operand 787 states and 1166 transitions. Second operand has 7 states, 7 states have (on average 50.142857142857146) internal successors, (351), 7 states have internal predecessors, (351), 0 states have call successors, (0), 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-12 00:54:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:35,406 INFO L93 Difference]: Finished difference Result 1546 states and 2300 transitions. [2024-11-12 00:54:35,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:54:35,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.142857142857146) internal successors, (351), 7 states have internal predecessors, (351), 0 states have call successors, (0), 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 351 [2024-11-12 00:54:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:35,408 INFO L225 Difference]: With dead ends: 1546 [2024-11-12 00:54:35,409 INFO L226 Difference]: Without dead ends: 857 [2024-11-12 00:54:35,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:54:35,410 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 157 mSDsluCounter, 4701 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 5659 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:35,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 5659 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:35,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-12 00:54:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 846. [2024-11-12 00:54:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.4828402366863904) internal successors, (1253), 845 states have internal predecessors, (1253), 0 states have call successors, (0), 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-12 00:54:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1253 transitions. [2024-11-12 00:54:35,421 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1253 transitions. Word has length 351 [2024-11-12 00:54:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:35,422 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1253 transitions. [2024-11-12 00:54:35,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.142857142857146) internal successors, (351), 7 states have internal predecessors, (351), 0 states have call successors, (0), 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-12 00:54:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1253 transitions. [2024-11-12 00:54:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-12 00:54:35,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:35,425 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:35,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 00:54:35,425 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:35,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1252985421, now seen corresponding path program 1 times [2024-11-12 00:54:35,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:35,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657723878] [2024-11-12 00:54:35,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:35,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:37,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:37,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657723878] [2024-11-12 00:54:37,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657723878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:37,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:37,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:54:37,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101852089] [2024-11-12 00:54:37,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:37,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:54:37,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:37,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:54:37,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:54:37,217 INFO L87 Difference]: Start difference. First operand 846 states and 1253 transitions. Second operand has 6 states, 6 states have (on average 58.666666666666664) internal successors, (352), 6 states have internal predecessors, (352), 0 states have call successors, (0), 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-12 00:54:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:37,258 INFO L93 Difference]: Finished difference Result 1592 states and 2366 transitions. [2024-11-12 00:54:37,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:54:37,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.666666666666664) internal successors, (352), 6 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352 [2024-11-12 00:54:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:37,261 INFO L225 Difference]: With dead ends: 1592 [2024-11-12 00:54:37,261 INFO L226 Difference]: Without dead ends: 903 [2024-11-12 00:54:37,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:54:37,263 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 58 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2994 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:37,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2994 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2024-11-12 00:54:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 876. [2024-11-12 00:54:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 1.48) internal successors, (1295), 875 states have internal predecessors, (1295), 0 states have call successors, (0), 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-12 00:54:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1295 transitions. [2024-11-12 00:54:37,274 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1295 transitions. Word has length 352 [2024-11-12 00:54:37,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:37,274 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1295 transitions. [2024-11-12 00:54:37,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.666666666666664) internal successors, (352), 6 states have internal predecessors, (352), 0 states have call successors, (0), 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-12 00:54:37,274 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1295 transitions. [2024-11-12 00:54:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-11-12 00:54:37,277 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:37,277 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:37,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 00:54:37,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:37,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1131304194, now seen corresponding path program 1 times [2024-11-12 00:54:37,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:37,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549931514] [2024-11-12 00:54:37,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:37,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:39,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:39,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549931514] [2024-11-12 00:54:39,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549931514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:39,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:39,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:54:39,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154698872] [2024-11-12 00:54:39,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:39,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:54:39,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:39,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:54:39,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:39,563 INFO L87 Difference]: Start difference. First operand 876 states and 1295 transitions. Second operand has 7 states, 7 states have (on average 50.42857142857143) internal successors, (353), 7 states have internal predecessors, (353), 0 states have call successors, (0), 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-12 00:54:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:39,729 INFO L93 Difference]: Finished difference Result 1905 states and 2832 transitions. [2024-11-12 00:54:39,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:54:39,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.42857142857143) internal successors, (353), 7 states have internal predecessors, (353), 0 states have call successors, (0), 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 353 [2024-11-12 00:54:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:39,733 INFO L225 Difference]: With dead ends: 1905 [2024-11-12 00:54:39,733 INFO L226 Difference]: Without dead ends: 1195 [2024-11-12 00:54:39,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:54:39,735 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 312 mSDsluCounter, 3812 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 4767 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:39,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 4767 Invalid, 63 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2024-11-12 00:54:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 937. [2024-11-12 00:54:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 936 states have (on average 1.4797008547008548) internal successors, (1385), 936 states have internal predecessors, (1385), 0 states have call successors, (0), 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-12 00:54:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1385 transitions. [2024-11-12 00:54:39,752 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1385 transitions. Word has length 353 [2024-11-12 00:54:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:39,753 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1385 transitions. [2024-11-12 00:54:39,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.42857142857143) internal successors, (353), 7 states have internal predecessors, (353), 0 states have call successors, (0), 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-12 00:54:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1385 transitions. [2024-11-12 00:54:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-12 00:54:39,756 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:39,756 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:39,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 00:54:39,756 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:39,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2135061390, now seen corresponding path program 1 times [2024-11-12 00:54:39,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:39,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660181638] [2024-11-12 00:54:39,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:39,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:42,275 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:42,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:42,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660181638] [2024-11-12 00:54:42,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660181638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:42,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:42,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:54:42,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854485897] [2024-11-12 00:54:42,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:42,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:54:42,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:42,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:54:42,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:54:42,279 INFO L87 Difference]: Start difference. First operand 937 states and 1385 transitions. Second operand has 8 states, 8 states have (on average 44.25) internal successors, (354), 8 states have internal predecessors, (354), 0 states have call successors, (0), 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-12 00:54:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:42,348 INFO L93 Difference]: Finished difference Result 1931 states and 2865 transitions. [2024-11-12 00:54:42,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:54:42,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 44.25) internal successors, (354), 8 states have internal predecessors, (354), 0 states have call successors, (0), 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 354 [2024-11-12 00:54:42,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:42,351 INFO L225 Difference]: With dead ends: 1931 [2024-11-12 00:54:42,351 INFO L226 Difference]: Without dead ends: 1160 [2024-11-12 00:54:42,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:54:42,354 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 165 mSDsluCounter, 3994 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 4946 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:42,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 4946 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:42,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-11-12 00:54:42,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1076. [2024-11-12 00:54:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 1075 states have (on average 1.48) internal successors, (1591), 1075 states have internal predecessors, (1591), 0 states have call successors, (0), 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-12 00:54:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1591 transitions. [2024-11-12 00:54:42,369 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1591 transitions. Word has length 354 [2024-11-12 00:54:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:42,369 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1591 transitions. [2024-11-12 00:54:42,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 44.25) internal successors, (354), 8 states have internal predecessors, (354), 0 states have call successors, (0), 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-12 00:54:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1591 transitions. [2024-11-12 00:54:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-12 00:54:42,373 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:42,373 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:42,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 00:54:42,373 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:42,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:42,374 INFO L85 PathProgramCache]: Analyzing trace with hash -887778963, now seen corresponding path program 1 times [2024-11-12 00:54:42,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:42,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402793503] [2024-11-12 00:54:42,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:42,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:42,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402793503] [2024-11-12 00:54:42,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402793503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:42,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:42,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:54:42,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096910754] [2024-11-12 00:54:42,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:42,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:54:42,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:42,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:54:42,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:42,932 INFO L87 Difference]: Start difference. First operand 1076 states and 1591 transitions. Second operand has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 0 states have call successors, (0), 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-12 00:54:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:42,961 INFO L93 Difference]: Finished difference Result 1994 states and 2958 transitions. [2024-11-12 00:54:42,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:54:42,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 0 states have call successors, (0), 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 355 [2024-11-12 00:54:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:42,965 INFO L225 Difference]: With dead ends: 1994 [2024-11-12 00:54:42,965 INFO L226 Difference]: Without dead ends: 1084 [2024-11-12 00:54:42,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:42,966 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 0 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:42,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2879 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:42,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-11-12 00:54:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2024-11-12 00:54:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 1.4764542936288088) internal successors, (1599), 1083 states have internal predecessors, (1599), 0 states have call successors, (0), 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-12 00:54:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1599 transitions. [2024-11-12 00:54:42,992 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1599 transitions. Word has length 355 [2024-11-12 00:54:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:42,992 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1599 transitions. [2024-11-12 00:54:42,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 0 states have call successors, (0), 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-12 00:54:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1599 transitions. [2024-11-12 00:54:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-12 00:54:42,998 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:42,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:42,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 00:54:42,999 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:42,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:42,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1889177997, now seen corresponding path program 1 times [2024-11-12 00:54:43,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:43,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184263056] [2024-11-12 00:54:43,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:43,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:44,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:44,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184263056] [2024-11-12 00:54:44,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184263056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:44,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:44,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:54:44,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728783958] [2024-11-12 00:54:44,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:44,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:54:44,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:44,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:54:44,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:54:44,545 INFO L87 Difference]: Start difference. First operand 1084 states and 1599 transitions. Second operand has 8 states, 8 states have (on average 44.375) internal successors, (355), 8 states have internal predecessors, (355), 0 states have call successors, (0), 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-12 00:54:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:44,620 INFO L93 Difference]: Finished difference Result 2165 states and 3201 transitions. [2024-11-12 00:54:44,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:54:44,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 44.375) internal successors, (355), 8 states have internal predecessors, (355), 0 states have call successors, (0), 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 355 [2024-11-12 00:54:44,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:44,624 INFO L225 Difference]: With dead ends: 2165 [2024-11-12 00:54:44,624 INFO L226 Difference]: Without dead ends: 1247 [2024-11-12 00:54:44,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:54:44,625 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 84 mSDsluCounter, 4825 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 5778 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:44,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 5778 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:54:44,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2024-11-12 00:54:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1198. [2024-11-12 00:54:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1197 states have (on average 1.4745196324143692) internal successors, (1765), 1197 states have internal predecessors, (1765), 0 states have call successors, (0), 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-12 00:54:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1765 transitions. [2024-11-12 00:54:44,641 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1765 transitions. Word has length 355 [2024-11-12 00:54:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:44,642 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1765 transitions. [2024-11-12 00:54:44,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 44.375) internal successors, (355), 8 states have internal predecessors, (355), 0 states have call successors, (0), 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-12 00:54:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1765 transitions. [2024-11-12 00:54:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-11-12 00:54:44,645 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:44,646 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:44,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 00:54:44,646 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:44,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:44,647 INFO L85 PathProgramCache]: Analyzing trace with hash -626276476, now seen corresponding path program 1 times [2024-11-12 00:54:44,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:44,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607147145] [2024-11-12 00:54:44,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:44,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:45,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607147145] [2024-11-12 00:54:45,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607147145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:45,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:45,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:54:45,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976175596] [2024-11-12 00:54:45,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:45,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:54:45,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:45,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:54:45,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:45,980 INFO L87 Difference]: Start difference. First operand 1198 states and 1765 transitions. Second operand has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 0 states have call successors, (0), 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-12 00:54:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:46,024 INFO L93 Difference]: Finished difference Result 2238 states and 3306 transitions. [2024-11-12 00:54:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:54:46,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 356 [2024-11-12 00:54:46,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:46,028 INFO L225 Difference]: With dead ends: 2238 [2024-11-12 00:54:46,028 INFO L226 Difference]: Without dead ends: 1206 [2024-11-12 00:54:46,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:46,030 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 6 mSDsluCounter, 2871 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:46,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3831 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2024-11-12 00:54:46,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1204. [2024-11-12 00:54:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1203 states have (on average 1.4738154613466334) internal successors, (1773), 1203 states have internal predecessors, (1773), 0 states have call successors, (0), 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-12 00:54:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1773 transitions. [2024-11-12 00:54:46,052 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1773 transitions. Word has length 356 [2024-11-12 00:54:46,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:46,053 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1773 transitions. [2024-11-12 00:54:46,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 0 states have call successors, (0), 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-12 00:54:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1773 transitions. [2024-11-12 00:54:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-11-12 00:54:46,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:46,057 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:46,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 00:54:46,057 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:46,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:46,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1112121167, now seen corresponding path program 1 times [2024-11-12 00:54:46,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:46,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138640912] [2024-11-12 00:54:46,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:46,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:48,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:48,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138640912] [2024-11-12 00:54:48,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138640912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:48,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:48,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:54:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742831387] [2024-11-12 00:54:48,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:48,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:54:48,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:48,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:54:48,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:48,407 INFO L87 Difference]: Start difference. First operand 1204 states and 1773 transitions. Second operand has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 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-12 00:54:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:48,479 INFO L93 Difference]: Finished difference Result 3802 states and 5624 transitions. [2024-11-12 00:54:48,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:54:48,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 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 357 [2024-11-12 00:54:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:48,487 INFO L225 Difference]: With dead ends: 3802 [2024-11-12 00:54:48,488 INFO L226 Difference]: Without dead ends: 2764 [2024-11-12 00:54:48,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:48,490 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 903 mSDsluCounter, 4774 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 5732 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:48,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 5732 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:48,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2024-11-12 00:54:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 1987. [2024-11-12 00:54:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1987 states, 1986 states have (on average 1.4768378650553877) internal successors, (2933), 1986 states have internal predecessors, (2933), 0 states have call successors, (0), 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-12 00:54:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2933 transitions. [2024-11-12 00:54:48,521 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2933 transitions. Word has length 357 [2024-11-12 00:54:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:48,521 INFO L471 AbstractCegarLoop]: Abstraction has 1987 states and 2933 transitions. [2024-11-12 00:54:48,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 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-12 00:54:48,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2933 transitions. [2024-11-12 00:54:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-11-12 00:54:48,526 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:48,527 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:48,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 00:54:48,527 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:48,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1878802481, now seen corresponding path program 1 times [2024-11-12 00:54:48,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:48,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694358071] [2024-11-12 00:54:48,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:48,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:50,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:50,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694358071] [2024-11-12 00:54:50,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694358071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:50,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:50,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 00:54:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801128373] [2024-11-12 00:54:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:50,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 00:54:50,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:50,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 00:54:50,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:54:50,024 INFO L87 Difference]: Start difference. First operand 1987 states and 2933 transitions. Second operand has 9 states, 9 states have (on average 39.77777777777778) internal successors, (358), 9 states have internal predecessors, (358), 0 states have call successors, (0), 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-12 00:54:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:50,229 INFO L93 Difference]: Finished difference Result 4147 states and 6133 transitions. [2024-11-12 00:54:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 00:54:50,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 39.77777777777778) internal successors, (358), 9 states have internal predecessors, (358), 0 states have call successors, (0), 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 358 [2024-11-12 00:54:50,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:50,238 INFO L225 Difference]: With dead ends: 4147 [2024-11-12 00:54:50,238 INFO L226 Difference]: Without dead ends: 2272 [2024-11-12 00:54:50,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-12 00:54:50,241 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 409 mSDsluCounter, 6547 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 7495 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:50,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 7495 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:54:50,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2024-11-12 00:54:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1992. [2024-11-12 00:54:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1991 states have (on average 1.4756403817177297) internal successors, (2938), 1991 states have internal predecessors, (2938), 0 states have call successors, (0), 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-12 00:54:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2938 transitions. [2024-11-12 00:54:50,276 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2938 transitions. Word has length 358 [2024-11-12 00:54:50,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:50,277 INFO L471 AbstractCegarLoop]: Abstraction has 1992 states and 2938 transitions. [2024-11-12 00:54:50,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.77777777777778) internal successors, (358), 9 states have internal predecessors, (358), 0 states have call successors, (0), 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-12 00:54:50,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2938 transitions. [2024-11-12 00:54:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-12 00:54:50,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:50,315 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:50,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 00:54:50,315 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:50,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2011477215, now seen corresponding path program 1 times [2024-11-12 00:54:50,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:50,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693686657] [2024-11-12 00:54:50,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:50,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:51,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:51,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693686657] [2024-11-12 00:54:51,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693686657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:51,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:51,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:54:51,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595198326] [2024-11-12 00:54:51,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:51,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:54:51,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:51,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:54:51,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:54:51,743 INFO L87 Difference]: Start difference. First operand 1992 states and 2938 transitions. Second operand has 8 states, 8 states have (on average 44.875) internal successors, (359), 8 states have internal predecessors, (359), 0 states have call successors, (0), 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-12 00:54:51,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:51,879 INFO L93 Difference]: Finished difference Result 3825 states and 5653 transitions. [2024-11-12 00:54:51,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:54:51,880 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 44.875) internal successors, (359), 8 states have internal predecessors, (359), 0 states have call successors, (0), 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 359 [2024-11-12 00:54:51,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:51,884 INFO L225 Difference]: With dead ends: 3825 [2024-11-12 00:54:51,885 INFO L226 Difference]: Without dead ends: 2004 [2024-11-12 00:54:51,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:54:51,887 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 922 mSDsluCounter, 4704 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 5648 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:51,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 5648 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:54:51,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2024-11-12 00:54:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1998. [2024-11-12 00:54:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1998 states, 1997 states have (on average 1.4752128192288432) internal successors, (2946), 1997 states have internal predecessors, (2946), 0 states have call successors, (0), 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-12 00:54:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2946 transitions. [2024-11-12 00:54:51,918 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2946 transitions. Word has length 359 [2024-11-12 00:54:51,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:51,919 INFO L471 AbstractCegarLoop]: Abstraction has 1998 states and 2946 transitions. [2024-11-12 00:54:51,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 44.875) internal successors, (359), 8 states have internal predecessors, (359), 0 states have call successors, (0), 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-12 00:54:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2946 transitions. [2024-11-12 00:54:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-12 00:54:51,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:51,923 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:51,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 00:54:51,924 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:51,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:51,925 INFO L85 PathProgramCache]: Analyzing trace with hash 879032887, now seen corresponding path program 1 times [2024-11-12 00:54:51,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:51,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182419164] [2024-11-12 00:54:51,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:51,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:52,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:52,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182419164] [2024-11-12 00:54:52,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182419164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:52,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:52,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:54:52,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097406200] [2024-11-12 00:54:52,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:52,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:54:52,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:52,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:54:52,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:52,690 INFO L87 Difference]: Start difference. First operand 1998 states and 2946 transitions. Second operand has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 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-12 00:54:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:52,746 INFO L93 Difference]: Finished difference Result 3841 states and 5673 transitions. [2024-11-12 00:54:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:54:52,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 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 359 [2024-11-12 00:54:52,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:52,757 INFO L225 Difference]: With dead ends: 3841 [2024-11-12 00:54:52,760 INFO L226 Difference]: Without dead ends: 2014 [2024-11-12 00:54:52,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:52,764 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 3 mSDsluCounter, 2874 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3836 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:52,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3836 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2024-11-12 00:54:52,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2014. [2024-11-12 00:54:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2014 states, 2013 states have (on average 1.4734227521112766) internal successors, (2966), 2013 states have internal predecessors, (2966), 0 states have call successors, (0), 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-12 00:54:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2966 transitions. [2024-11-12 00:54:52,806 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2966 transitions. Word has length 359 [2024-11-12 00:54:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:52,807 INFO L471 AbstractCegarLoop]: Abstraction has 2014 states and 2966 transitions. [2024-11-12 00:54:52,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 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-12 00:54:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2966 transitions. [2024-11-12 00:54:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-11-12 00:54:52,811 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:52,812 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:52,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 00:54:52,812 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:52,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:52,814 INFO L85 PathProgramCache]: Analyzing trace with hash 500024036, now seen corresponding path program 1 times [2024-11-12 00:54:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:52,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514799630] [2024-11-12 00:54:52,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:52,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:54,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:54,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514799630] [2024-11-12 00:54:54,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514799630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:54,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:54,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 00:54:54,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681610963] [2024-11-12 00:54:54,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:54,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 00:54:54,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:54,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 00:54:54,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:54:54,556 INFO L87 Difference]: Start difference. First operand 2014 states and 2966 transitions. Second operand has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 states have internal predecessors, (360), 0 states have call successors, (0), 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-12 00:54:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:54,932 INFO L93 Difference]: Finished difference Result 4164 states and 6149 transitions. [2024-11-12 00:54:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 00:54:54,932 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 states have internal predecessors, (360), 0 states have call successors, (0), 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 360 [2024-11-12 00:54:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:54,941 INFO L225 Difference]: With dead ends: 4164 [2024-11-12 00:54:54,941 INFO L226 Difference]: Without dead ends: 2321 [2024-11-12 00:54:54,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-12 00:54:54,948 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 626 mSDsluCounter, 5855 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 6799 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:54,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 6799 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:54:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2024-11-12 00:54:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2037. [2024-11-12 00:54:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2036 states have (on average 1.4724950884086443) internal successors, (2998), 2036 states have internal predecessors, (2998), 0 states have call successors, (0), 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-12 00:54:54,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2998 transitions. [2024-11-12 00:54:54,978 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2998 transitions. Word has length 360 [2024-11-12 00:54:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:54,978 INFO L471 AbstractCegarLoop]: Abstraction has 2037 states and 2998 transitions. [2024-11-12 00:54:54,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 states have internal predecessors, (360), 0 states have call successors, (0), 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-12 00:54:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2998 transitions. [2024-11-12 00:54:54,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-11-12 00:54:54,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:54,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:54,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 00:54:54,982 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:54,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:54,982 INFO L85 PathProgramCache]: Analyzing trace with hash 592250731, now seen corresponding path program 1 times [2024-11-12 00:54:54,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:54,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040748208] [2024-11-12 00:54:54,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:54,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:55,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:55,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040748208] [2024-11-12 00:54:55,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040748208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:55,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:55,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:54:55,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024426335] [2024-11-12 00:54:55,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:55,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:54:55,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:55,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:54:55,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:55,559 INFO L87 Difference]: Start difference. First operand 2037 states and 2998 transitions. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 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-12 00:54:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:55,613 INFO L93 Difference]: Finished difference Result 3895 states and 5744 transitions. [2024-11-12 00:54:55,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:54:55,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 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 360 [2024-11-12 00:54:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:55,622 INFO L225 Difference]: With dead ends: 3895 [2024-11-12 00:54:55,622 INFO L226 Difference]: Without dead ends: 2044 [2024-11-12 00:54:55,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:55,625 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 140 mSDsluCounter, 2794 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 3754 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:55,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 3754 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:55,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2024-11-12 00:54:55,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2024-11-12 00:54:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 2043 states have (on average 1.47136563876652) internal successors, (3006), 2043 states have internal predecessors, (3006), 0 states have call successors, (0), 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-12 00:54:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3006 transitions. [2024-11-12 00:54:55,652 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3006 transitions. Word has length 360 [2024-11-12 00:54:55,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:55,652 INFO L471 AbstractCegarLoop]: Abstraction has 2044 states and 3006 transitions. [2024-11-12 00:54:55,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 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-12 00:54:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3006 transitions. [2024-11-12 00:54:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-11-12 00:54:55,656 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:55,656 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:55,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 00:54:55,657 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:55,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:55,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1560099086, now seen corresponding path program 1 times [2024-11-12 00:54:55,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:55,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159297388] [2024-11-12 00:54:55,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:56,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:56,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159297388] [2024-11-12 00:54:56,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159297388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:56,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:56,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:54:56,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463300324] [2024-11-12 00:54:56,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:56,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:54:56,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:56,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:54:56,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:56,567 INFO L87 Difference]: Start difference. First operand 2044 states and 3006 transitions. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 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-12 00:54:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:56,668 INFO L93 Difference]: Finished difference Result 5505 states and 8126 transitions. [2024-11-12 00:54:56,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:54:56,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 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 360 [2024-11-12 00:54:56,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:56,674 INFO L225 Difference]: With dead ends: 5505 [2024-11-12 00:54:56,675 INFO L226 Difference]: Without dead ends: 3639 [2024-11-12 00:54:56,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:56,677 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 2394 mSDsluCounter, 1910 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2394 SdHoareTripleChecker+Valid, 2868 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:56,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2394 Valid, 2868 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:54:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2024-11-12 00:54:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 2021. [2024-11-12 00:54:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2021 states, 2020 states have (on average 1.4717821782178218) internal successors, (2973), 2020 states have internal predecessors, (2973), 0 states have call successors, (0), 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-12 00:54:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2973 transitions. [2024-11-12 00:54:56,712 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2973 transitions. Word has length 360 [2024-11-12 00:54:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:56,713 INFO L471 AbstractCegarLoop]: Abstraction has 2021 states and 2973 transitions. [2024-11-12 00:54:56,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 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-12 00:54:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2973 transitions. [2024-11-12 00:54:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-11-12 00:54:56,716 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:56,716 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:56,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 00:54:56,716 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:56,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1894101272, now seen corresponding path program 1 times [2024-11-12 00:54:56,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:56,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79649741] [2024-11-12 00:54:56,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:56,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:58,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:58,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79649741] [2024-11-12 00:54:58,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79649741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:58,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:58,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:54:58,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252115880] [2024-11-12 00:54:58,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:58,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:54:58,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:58,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:54:58,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:54:58,018 INFO L87 Difference]: Start difference. First operand 2021 states and 2973 transitions. Second operand has 8 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 0 states have call successors, (0), 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-12 00:54:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:58,155 INFO L93 Difference]: Finished difference Result 3870 states and 5706 transitions. [2024-11-12 00:54:58,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:54:58,155 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 0 states have call successors, (0), 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 361 [2024-11-12 00:54:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:58,159 INFO L225 Difference]: With dead ends: 3870 [2024-11-12 00:54:58,159 INFO L226 Difference]: Without dead ends: 2027 [2024-11-12 00:54:58,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:54:58,161 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 969 mSDsluCounter, 4708 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 5652 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:58,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 5652 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:54:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2024-11-12 00:54:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2023. [2024-11-12 00:54:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2023 states, 2022 states have (on average 1.4713155291790307) internal successors, (2975), 2022 states have internal predecessors, (2975), 0 states have call successors, (0), 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-12 00:54:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2975 transitions. [2024-11-12 00:54:58,185 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2975 transitions. Word has length 361 [2024-11-12 00:54:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:58,185 INFO L471 AbstractCegarLoop]: Abstraction has 2023 states and 2975 transitions. [2024-11-12 00:54:58,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 0 states have call successors, (0), 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-12 00:54:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2975 transitions. [2024-11-12 00:54:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-11-12 00:54:58,190 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:58,190 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:58,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 00:54:58,190 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:58,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1148973956, now seen corresponding path program 1 times [2024-11-12 00:54:58,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:58,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363418881] [2024-11-12 00:54:58,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:58,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:59,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:59,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363418881] [2024-11-12 00:54:59,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363418881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:59,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:59,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:54:59,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509760782] [2024-11-12 00:54:59,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:59,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:54:59,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:59,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:54:59,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:54:59,466 INFO L87 Difference]: Start difference. First operand 2023 states and 2975 transitions. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 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-12 00:54:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:59,505 INFO L93 Difference]: Finished difference Result 3880 states and 5720 transitions. [2024-11-12 00:54:59,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:54:59,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 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 361 [2024-11-12 00:54:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:59,509 INFO L225 Difference]: With dead ends: 3880 [2024-11-12 00:54:59,509 INFO L226 Difference]: Without dead ends: 2035 [2024-11-12 00:54:59,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-12 00:54:59,511 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 0 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2875 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:59,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2875 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:59,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2024-11-12 00:54:59,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2035. [2024-11-12 00:54:59,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 2034 states have (on average 1.4695181907571289) internal successors, (2989), 2034 states have internal predecessors, (2989), 0 states have call successors, (0), 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-12 00:54:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2989 transitions. [2024-11-12 00:54:59,537 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2989 transitions. Word has length 361 [2024-11-12 00:54:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:59,538 INFO L471 AbstractCegarLoop]: Abstraction has 2035 states and 2989 transitions. [2024-11-12 00:54:59,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 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-12 00:54:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2989 transitions. [2024-11-12 00:54:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-11-12 00:54:59,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:59,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:59,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 00:54:59,542 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:59,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:59,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1993610015, now seen corresponding path program 1 times [2024-11-12 00:54:59,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:59,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173711839] [2024-11-12 00:54:59,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:59,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:00,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:00,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173711839] [2024-11-12 00:55:00,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173711839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:00,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:00,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:55:00,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211697723] [2024-11-12 00:55:00,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:00,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:55:00,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:00,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:55:00,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:55:00,199 INFO L87 Difference]: Start difference. First operand 2035 states and 2989 transitions. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 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-12 00:55:00,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:00,238 INFO L93 Difference]: Finished difference Result 3924 states and 5774 transitions. [2024-11-12 00:55:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:55:00,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 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 361 [2024-11-12 00:55:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:00,241 INFO L225 Difference]: With dead ends: 3924 [2024-11-12 00:55:00,241 INFO L226 Difference]: Without dead ends: 2067 [2024-11-12 00:55:00,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:55:00,243 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 3 mSDsluCounter, 2874 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3836 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:00,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3836 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:55:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2024-11-12 00:55:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2067. [2024-11-12 00:55:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 2066 states have (on average 1.4661181026137464) internal successors, (3029), 2066 states have internal predecessors, (3029), 0 states have call successors, (0), 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-12 00:55:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 3029 transitions. [2024-11-12 00:55:00,264 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 3029 transitions. Word has length 361 [2024-11-12 00:55:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:00,265 INFO L471 AbstractCegarLoop]: Abstraction has 2067 states and 3029 transitions. [2024-11-12 00:55:00,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 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-12 00:55:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 3029 transitions. [2024-11-12 00:55:00,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-11-12 00:55:00,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:00,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:00,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 00:55:00,269 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:00,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:00,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1114578686, now seen corresponding path program 1 times [2024-11-12 00:55:00,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:00,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172952813] [2024-11-12 00:55:00,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:00,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:02,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:02,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172952813] [2024-11-12 00:55:02,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172952813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:02,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:02,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 00:55:02,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924735419] [2024-11-12 00:55:02,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:02,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 00:55:02,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:02,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 00:55:02,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:55:02,587 INFO L87 Difference]: Start difference. First operand 2067 states and 3029 transitions. Second operand has 9 states, 9 states have (on average 40.22222222222222) internal successors, (362), 9 states have internal predecessors, (362), 0 states have call successors, (0), 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-12 00:55:02,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:02,711 INFO L93 Difference]: Finished difference Result 4568 states and 6706 transitions. [2024-11-12 00:55:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 00:55:02,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 40.22222222222222) internal successors, (362), 9 states have internal predecessors, (362), 0 states have call successors, (0), 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 362 [2024-11-12 00:55:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:02,716 INFO L225 Difference]: With dead ends: 4568 [2024-11-12 00:55:02,716 INFO L226 Difference]: Without dead ends: 2679 [2024-11-12 00:55:02,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:55:02,718 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 120 mSDsluCounter, 6639 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 7590 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:02,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 7590 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:55:02,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2024-11-12 00:55:02,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 2667. [2024-11-12 00:55:02,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2667 states, 2666 states have (on average 1.4632408102025507) internal successors, (3901), 2666 states have internal predecessors, (3901), 0 states have call successors, (0), 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-12 00:55:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 3901 transitions. [2024-11-12 00:55:02,747 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 3901 transitions. Word has length 362 [2024-11-12 00:55:02,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:02,748 INFO L471 AbstractCegarLoop]: Abstraction has 2667 states and 3901 transitions. [2024-11-12 00:55:02,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 40.22222222222222) internal successors, (362), 9 states have internal predecessors, (362), 0 states have call successors, (0), 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-12 00:55:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 3901 transitions. [2024-11-12 00:55:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-12 00:55:02,753 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:02,758 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:02,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 00:55:02,758 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:02,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1312437772, now seen corresponding path program 1 times [2024-11-12 00:55:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:02,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371597463] [2024-11-12 00:55:02,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:02,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:05,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:05,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371597463] [2024-11-12 00:55:05,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371597463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:05,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:05,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 00:55:05,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082711178] [2024-11-12 00:55:05,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:05,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 00:55:05,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:05,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 00:55:05,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:55:05,392 INFO L87 Difference]: Start difference. First operand 2667 states and 3901 transitions. Second operand has 11 states, 11 states have (on average 33.0) internal successors, (363), 11 states have internal predecessors, (363), 0 states have call successors, (0), 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-12 00:55:05,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:05,532 INFO L93 Difference]: Finished difference Result 5178 states and 7584 transitions. [2024-11-12 00:55:05,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 00:55:05,532 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 33.0) internal successors, (363), 11 states have internal predecessors, (363), 0 states have call successors, (0), 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 363 [2024-11-12 00:55:05,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:05,535 INFO L225 Difference]: With dead ends: 5178 [2024-11-12 00:55:05,535 INFO L226 Difference]: Without dead ends: 2689 [2024-11-12 00:55:05,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:55:05,538 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 122 mSDsluCounter, 8473 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 9417 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:05,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 9417 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:55:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2024-11-12 00:55:05,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2673. [2024-11-12 00:55:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.4629491017964071) internal successors, (3909), 2672 states have internal predecessors, (3909), 0 states have call successors, (0), 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-12 00:55:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 3909 transitions. [2024-11-12 00:55:05,611 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 3909 transitions. Word has length 363 [2024-11-12 00:55:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:05,611 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 3909 transitions. [2024-11-12 00:55:05,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 33.0) internal successors, (363), 11 states have internal predecessors, (363), 0 states have call successors, (0), 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-12 00:55:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 3909 transitions. [2024-11-12 00:55:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-12 00:55:05,615 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:05,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:05,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 00:55:05,615 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:05,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:05,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1279785818, now seen corresponding path program 1 times [2024-11-12 00:55:05,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:05,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334805373] [2024-11-12 00:55:05,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:08,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:08,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334805373] [2024-11-12 00:55:08,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334805373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:08,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:08,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-12 00:55:08,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845452413] [2024-11-12 00:55:08,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:08,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 00:55:08,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:08,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 00:55:08,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-12 00:55:08,450 INFO L87 Difference]: Start difference. First operand 2673 states and 3909 transitions. Second operand has 18 states, 18 states have (on average 20.166666666666668) internal successors, (363), 18 states have internal predecessors, (363), 0 states have call successors, (0), 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-12 00:55:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:09,021 INFO L93 Difference]: Finished difference Result 5538 states and 8112 transitions. [2024-11-12 00:55:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 00:55:09,022 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 20.166666666666668) internal successors, (363), 18 states have internal predecessors, (363), 0 states have call successors, (0), 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 363 [2024-11-12 00:55:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:09,026 INFO L225 Difference]: With dead ends: 5538 [2024-11-12 00:55:09,026 INFO L226 Difference]: Without dead ends: 3001 [2024-11-12 00:55:09,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2024-11-12 00:55:09,029 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 677 mSDsluCounter, 11037 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 11958 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:09,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 11958 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 00:55:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2024-11-12 00:55:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2752. [2024-11-12 00:55:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2752 states, 2751 states have (on average 1.4609233006179572) internal successors, (4019), 2751 states have internal predecessors, (4019), 0 states have call successors, (0), 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-12 00:55:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 4019 transitions. [2024-11-12 00:55:09,052 INFO L78 Accepts]: Start accepts. Automaton has 2752 states and 4019 transitions. Word has length 363 [2024-11-12 00:55:09,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:09,052 INFO L471 AbstractCegarLoop]: Abstraction has 2752 states and 4019 transitions. [2024-11-12 00:55:09,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 20.166666666666668) internal successors, (363), 18 states have internal predecessors, (363), 0 states have call successors, (0), 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-12 00:55:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 4019 transitions. [2024-11-12 00:55:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-12 00:55:09,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:09,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:09,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-12 00:55:09,058 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:09,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1751935056, now seen corresponding path program 1 times [2024-11-12 00:55:09,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:09,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749827230] [2024-11-12 00:55:09,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:09,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:10,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:10,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749827230] [2024-11-12 00:55:10,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749827230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:10,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:10,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:55:10,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110361900] [2024-11-12 00:55:10,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:10,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:55:10,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:10,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:55:10,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:55:10,679 INFO L87 Difference]: Start difference. First operand 2752 states and 4019 transitions. Second operand has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 0 states have call successors, (0), 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-12 00:55:10,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:10,712 INFO L93 Difference]: Finished difference Result 5279 states and 7728 transitions. [2024-11-12 00:55:10,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:55:10,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 0 states have call successors, (0), 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 363 [2024-11-12 00:55:10,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:10,721 INFO L225 Difference]: With dead ends: 5279 [2024-11-12 00:55:10,724 INFO L226 Difference]: Without dead ends: 2784 [2024-11-12 00:55:10,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:55:10,727 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 14 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2871 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:10,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2871 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:55:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2024-11-12 00:55:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2768. [2024-11-12 00:55:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2768 states, 2767 states have (on average 1.4582580411998554) internal successors, (4035), 2767 states have internal predecessors, (4035), 0 states have call successors, (0), 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-12 00:55:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 4035 transitions. [2024-11-12 00:55:10,783 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 4035 transitions. Word has length 363 [2024-11-12 00:55:10,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:10,784 INFO L471 AbstractCegarLoop]: Abstraction has 2768 states and 4035 transitions. [2024-11-12 00:55:10,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 0 states have call successors, (0), 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-12 00:55:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 4035 transitions. [2024-11-12 00:55:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2024-11-12 00:55:10,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:10,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:10,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-12 00:55:10,791 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:10,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:10,795 INFO L85 PathProgramCache]: Analyzing trace with hash -102331257, now seen corresponding path program 1 times [2024-11-12 00:55:10,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:10,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731959691] [2024-11-12 00:55:10,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:10,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:12,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:12,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731959691] [2024-11-12 00:55:12,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731959691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:12,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:12,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:55:12,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565528150] [2024-11-12 00:55:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:12,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:55:12,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:12,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:55:12,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:55:12,168 INFO L87 Difference]: Start difference. First operand 2768 states and 4035 transitions. Second operand has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 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-12 00:55:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:12,220 INFO L93 Difference]: Finished difference Result 5451 states and 7960 transitions. [2024-11-12 00:55:12,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:55:12,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 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 364 [2024-11-12 00:55:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:12,224 INFO L225 Difference]: With dead ends: 5451 [2024-11-12 00:55:12,224 INFO L226 Difference]: Without dead ends: 2940 [2024-11-12 00:55:12,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:55:12,226 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 19 mSDsluCounter, 3831 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4787 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:12,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4787 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:55:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2024-11-12 00:55:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2912. [2024-11-12 00:55:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2912 states, 2911 states have (on average 1.454826520096187) internal successors, (4235), 2911 states have internal predecessors, (4235), 0 states have call successors, (0), 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-12 00:55:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 4235 transitions. [2024-11-12 00:55:12,248 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 4235 transitions. Word has length 364 [2024-11-12 00:55:12,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:12,248 INFO L471 AbstractCegarLoop]: Abstraction has 2912 states and 4235 transitions. [2024-11-12 00:55:12,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 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-12 00:55:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 4235 transitions. [2024-11-12 00:55:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2024-11-12 00:55:12,251 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:12,252 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:12,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-12 00:55:12,252 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:12,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:12,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1695683232, now seen corresponding path program 1 times [2024-11-12 00:55:12,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:12,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535180800] [2024-11-12 00:55:12,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:12,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:12,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:12,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535180800] [2024-11-12 00:55:12,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535180800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:12,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:12,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:55:12,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584689715] [2024-11-12 00:55:12,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:12,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:55:12,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:12,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:55:12,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:55:12,769 INFO L87 Difference]: Start difference. First operand 2912 states and 4235 transitions. Second operand has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 0 states have call successors, (0), 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-12 00:55:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:12,794 INFO L93 Difference]: Finished difference Result 5583 states and 8136 transitions. [2024-11-12 00:55:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:55:12,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 0 states have call successors, (0), 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 364 [2024-11-12 00:55:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:12,799 INFO L225 Difference]: With dead ends: 5583 [2024-11-12 00:55:12,799 INFO L226 Difference]: Without dead ends: 2928 [2024-11-12 00:55:12,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:55:12,803 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 0 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:12,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2879 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:55:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2024-11-12 00:55:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2928. [2024-11-12 00:55:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2927 states have (on average 1.4523402801503245) internal successors, (4251), 2927 states have internal predecessors, (4251), 0 states have call successors, (0), 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-12 00:55:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 4251 transitions. [2024-11-12 00:55:12,833 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 4251 transitions. Word has length 364 [2024-11-12 00:55:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:12,833 INFO L471 AbstractCegarLoop]: Abstraction has 2928 states and 4251 transitions. [2024-11-12 00:55:12,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 0 states have call successors, (0), 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-12 00:55:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 4251 transitions. [2024-11-12 00:55:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-12 00:55:12,837 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:12,837 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:12,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-12 00:55:12,837 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:12,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1370360691, now seen corresponding path program 1 times [2024-11-12 00:55:12,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:12,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771370729] [2024-11-12 00:55:12,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:12,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:14,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:14,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771370729] [2024-11-12 00:55:14,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771370729] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:55:14,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570943146] [2024-11-12 00:55:14,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:14,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:55:14,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:55:14,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 00:55:14,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 00:55:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:15,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 2095 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-12 00:55:15,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:55:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:16,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 00:55:16,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570943146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:16,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 00:55:16,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2024-11-12 00:55:16,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546581153] [2024-11-12 00:55:16,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:16,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 00:55:16,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:16,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 00:55:16,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2024-11-12 00:55:16,451 INFO L87 Difference]: Start difference. First operand 2928 states and 4251 transitions. Second operand has 13 states, 13 states have (on average 28.076923076923077) internal successors, (365), 13 states have internal predecessors, (365), 0 states have call successors, (0), 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-12 00:55:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:16,620 INFO L93 Difference]: Finished difference Result 8293 states and 12051 transitions. [2024-11-12 00:55:16,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 00:55:16,620 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 28.076923076923077) internal successors, (365), 13 states have internal predecessors, (365), 0 states have call successors, (0), 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 365 [2024-11-12 00:55:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:16,627 INFO L225 Difference]: With dead ends: 8293 [2024-11-12 00:55:16,627 INFO L226 Difference]: Without dead ends: 5538 [2024-11-12 00:55:16,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2024-11-12 00:55:16,632 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 489 mSDsluCounter, 7686 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 8628 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:16,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 8628 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:55:16,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5538 states. [2024-11-12 00:55:16,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5538 to 5515. [2024-11-12 00:55:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5515 states, 5514 states have (on average 1.4521218715995647) internal successors, (8007), 5514 states have internal predecessors, (8007), 0 states have call successors, (0), 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-12 00:55:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5515 states to 5515 states and 8007 transitions. [2024-11-12 00:55:16,685 INFO L78 Accepts]: Start accepts. Automaton has 5515 states and 8007 transitions. Word has length 365 [2024-11-12 00:55:16,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:16,686 INFO L471 AbstractCegarLoop]: Abstraction has 5515 states and 8007 transitions. [2024-11-12 00:55:16,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 28.076923076923077) internal successors, (365), 13 states have internal predecessors, (365), 0 states have call successors, (0), 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-12 00:55:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 5515 states and 8007 transitions. [2024-11-12 00:55:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-11-12 00:55:16,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:16,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:16,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 00:55:16,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-12 00:55:16,895 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:16,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash 579173852, now seen corresponding path program 1 times [2024-11-12 00:55:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:16,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061454618] [2024-11-12 00:55:16,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:16,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:18,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:18,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061454618] [2024-11-12 00:55:18,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061454618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:18,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:18,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 00:55:18,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080217562] [2024-11-12 00:55:18,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:18,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 00:55:18,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:18,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 00:55:18,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:55:18,677 INFO L87 Difference]: Start difference. First operand 5515 states and 8007 transitions. Second operand has 11 states, 11 states have (on average 33.27272727272727) internal successors, (366), 11 states have internal predecessors, (366), 0 states have call successors, (0), 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-12 00:55:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:18,936 INFO L93 Difference]: Finished difference Result 15733 states and 22899 transitions. [2024-11-12 00:55:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 00:55:18,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 33.27272727272727) internal successors, (366), 11 states have internal predecessors, (366), 0 states have call successors, (0), 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 366 [2024-11-12 00:55:18,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:18,949 INFO L225 Difference]: With dead ends: 15733 [2024-11-12 00:55:18,949 INFO L226 Difference]: Without dead ends: 10559 [2024-11-12 00:55:18,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-12 00:55:18,958 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 2965 mSDsluCounter, 7568 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2965 SdHoareTripleChecker+Valid, 8515 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:18,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2965 Valid, 8515 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:55:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2024-11-12 00:55:19,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 5753. [2024-11-12 00:55:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5753 states, 5752 states have (on average 1.4539290681502086) internal successors, (8363), 5752 states have internal predecessors, (8363), 0 states have call successors, (0), 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-12 00:55:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5753 states to 5753 states and 8363 transitions. [2024-11-12 00:55:19,037 INFO L78 Accepts]: Start accepts. Automaton has 5753 states and 8363 transitions. Word has length 366 [2024-11-12 00:55:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:19,038 INFO L471 AbstractCegarLoop]: Abstraction has 5753 states and 8363 transitions. [2024-11-12 00:55:19,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 33.27272727272727) internal successors, (366), 11 states have internal predecessors, (366), 0 states have call successors, (0), 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-12 00:55:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 5753 states and 8363 transitions. [2024-11-12 00:55:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-11-12 00:55:19,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:19,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:19,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-12 00:55:19,046 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:19,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:19,046 INFO L85 PathProgramCache]: Analyzing trace with hash 57250913, now seen corresponding path program 1 times [2024-11-12 00:55:19,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:19,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767331195] [2024-11-12 00:55:19,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:19,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:20,881 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:20,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:20,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767331195] [2024-11-12 00:55:20,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767331195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:20,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:20,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 00:55:20,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031235872] [2024-11-12 00:55:20,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:20,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 00:55:20,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:20,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 00:55:20,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:55:20,883 INFO L87 Difference]: Start difference. First operand 5753 states and 8363 transitions. Second operand has 12 states, 12 states have (on average 30.583333333333332) internal successors, (367), 12 states have internal predecessors, (367), 0 states have call successors, (0), 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-12 00:55:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:21,082 INFO L93 Difference]: Finished difference Result 16161 states and 23515 transitions. [2024-11-12 00:55:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 00:55:21,083 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 30.583333333333332) internal successors, (367), 12 states have internal predecessors, (367), 0 states have call successors, (0), 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 367 [2024-11-12 00:55:21,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:21,093 INFO L225 Difference]: With dead ends: 16161 [2024-11-12 00:55:21,093 INFO L226 Difference]: Without dead ends: 10987 [2024-11-12 00:55:21,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-12 00:55:21,100 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 579 mSDsluCounter, 9049 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 9991 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:21,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 9991 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:55:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10987 states. [2024-11-12 00:55:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10987 to 10983. [2024-11-12 00:55:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10983 states, 10982 states have (on average 1.454288836277545) internal successors, (15971), 10982 states have internal predecessors, (15971), 0 states have call successors, (0), 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-12 00:55:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10983 states to 10983 states and 15971 transitions. [2024-11-12 00:55:21,181 INFO L78 Accepts]: Start accepts. Automaton has 10983 states and 15971 transitions. Word has length 367 [2024-11-12 00:55:21,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:21,181 INFO L471 AbstractCegarLoop]: Abstraction has 10983 states and 15971 transitions. [2024-11-12 00:55:21,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.583333333333332) internal successors, (367), 12 states have internal predecessors, (367), 0 states have call successors, (0), 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-12 00:55:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 10983 states and 15971 transitions. [2024-11-12 00:55:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-12 00:55:21,235 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:21,235 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:21,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-12 00:55:21,235 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:21,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:21,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1969801767, now seen corresponding path program 1 times [2024-11-12 00:55:21,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:21,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406900576] [2024-11-12 00:55:21,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:21,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:22,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:22,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406900576] [2024-11-12 00:55:22,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406900576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:22,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:22,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:55:22,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220887008] [2024-11-12 00:55:22,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:22,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:55:22,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:22,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:55:22,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:55:22,997 INFO L87 Difference]: Start difference. First operand 10983 states and 15971 transitions. Second operand has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:23,108 INFO L93 Difference]: Finished difference Result 26419 states and 38461 transitions. [2024-11-12 00:55:23,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:55:23,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2024-11-12 00:55:23,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:23,136 INFO L225 Difference]: With dead ends: 26419 [2024-11-12 00:55:23,137 INFO L226 Difference]: Without dead ends: 21245 [2024-11-12 00:55:23,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:55:23,150 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 408 mSDsluCounter, 4687 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 5638 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:23,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 5638 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:55:23,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21245 states. [2024-11-12 00:55:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21245 to 21241. [2024-11-12 00:55:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21241 states, 21240 states have (on average 1.45560263653484) internal successors, (30917), 21240 states have internal predecessors, (30917), 0 states have call successors, (0), 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-12 00:55:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21241 states to 21241 states and 30917 transitions. [2024-11-12 00:55:23,334 INFO L78 Accepts]: Start accepts. Automaton has 21241 states and 30917 transitions. Word has length 368 [2024-11-12 00:55:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:23,334 INFO L471 AbstractCegarLoop]: Abstraction has 21241 states and 30917 transitions. [2024-11-12 00:55:23,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 21241 states and 30917 transitions. [2024-11-12 00:55:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-12 00:55:23,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:23,354 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:23,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-12 00:55:23,354 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:23,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:23,355 INFO L85 PathProgramCache]: Analyzing trace with hash -843302247, now seen corresponding path program 1 times [2024-11-12 00:55:23,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:23,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109955325] [2024-11-12 00:55:23,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:23,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:25,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:25,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109955325] [2024-11-12 00:55:25,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109955325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:55:25,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241194891] [2024-11-12 00:55:25,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:25,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:55:25,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:55:25,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 00:55:25,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 00:55:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:26,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 2104 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 00:55:26,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:55:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:29,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 00:55:29,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241194891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:29,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 00:55:29,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2024-11-12 00:55:29,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938291575] [2024-11-12 00:55:29,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:29,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 00:55:29,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:29,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 00:55:29,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2024-11-12 00:55:29,215 INFO L87 Difference]: Start difference. First operand 21241 states and 30917 transitions. Second operand has 12 states, 12 states have (on average 30.666666666666668) internal successors, (368), 12 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:29,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:29,429 INFO L93 Difference]: Finished difference Result 46449 states and 67629 transitions. [2024-11-12 00:55:29,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 00:55:29,429 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 30.666666666666668) internal successors, (368), 12 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2024-11-12 00:55:29,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:29,463 INFO L225 Difference]: With dead ends: 46449 [2024-11-12 00:55:29,463 INFO L226 Difference]: Without dead ends: 31193 [2024-11-12 00:55:29,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2024-11-12 00:55:29,484 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 520 mSDsluCounter, 6766 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 7713 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:29,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 7713 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:55:29,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31193 states. [2024-11-12 00:55:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31193 to 28693. [2024-11-12 00:55:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28693 states, 28692 states have (on average 1.4558413495050886) internal successors, (41771), 28692 states have internal predecessors, (41771), 0 states have call successors, (0), 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-12 00:55:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28693 states to 28693 states and 41771 transitions. [2024-11-12 00:55:29,738 INFO L78 Accepts]: Start accepts. Automaton has 28693 states and 41771 transitions. Word has length 368 [2024-11-12 00:55:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:29,739 INFO L471 AbstractCegarLoop]: Abstraction has 28693 states and 41771 transitions. [2024-11-12 00:55:29,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.666666666666668) internal successors, (368), 12 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:29,739 INFO L276 IsEmpty]: Start isEmpty. Operand 28693 states and 41771 transitions. [2024-11-12 00:55:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-12 00:55:29,759 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:29,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:29,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 00:55:29,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-12 00:55:29,964 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:29,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:29,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1130961003, now seen corresponding path program 1 times [2024-11-12 00:55:29,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:29,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787349612] [2024-11-12 00:55:29,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:29,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:32,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787349612] [2024-11-12 00:55:32,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787349612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:32,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:32,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:55:32,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842832355] [2024-11-12 00:55:32,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:32,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:55:32,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:32,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:55:32,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:55:32,089 INFO L87 Difference]: Start difference. First operand 28693 states and 41771 transitions. Second operand has 7 states, 7 states have (on average 52.57142857142857) internal successors, (368), 7 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:32,291 INFO L93 Difference]: Finished difference Result 68259 states and 99479 transitions. [2024-11-12 00:55:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:55:32,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.57142857142857) internal successors, (368), 7 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2024-11-12 00:55:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:32,337 INFO L225 Difference]: With dead ends: 68259 [2024-11-12 00:55:32,337 INFO L226 Difference]: Without dead ends: 44027 [2024-11-12 00:55:32,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:55:32,362 INFO L435 NwaCegarLoop]: 957 mSDtfsCounter, 345 mSDsluCounter, 3828 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 4785 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:32,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 4785 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:55:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44027 states. [2024-11-12 00:55:32,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44027 to 28737. [2024-11-12 00:55:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28737 states, 28736 states have (on average 1.4551433741648108) internal successors, (41815), 28736 states have internal predecessors, (41815), 0 states have call successors, (0), 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-12 00:55:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28737 states to 28737 states and 41815 transitions. [2024-11-12 00:55:32,653 INFO L78 Accepts]: Start accepts. Automaton has 28737 states and 41815 transitions. Word has length 368 [2024-11-12 00:55:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:32,654 INFO L471 AbstractCegarLoop]: Abstraction has 28737 states and 41815 transitions. [2024-11-12 00:55:32,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.57142857142857) internal successors, (368), 7 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 28737 states and 41815 transitions. [2024-11-12 00:55:32,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-12 00:55:32,701 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:32,701 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:32,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-12 00:55:32,704 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:32,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:32,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2143333355, now seen corresponding path program 1 times [2024-11-12 00:55:32,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:32,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885712465] [2024-11-12 00:55:32,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:32,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:34,511 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:34,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:34,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885712465] [2024-11-12 00:55:34,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885712465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:34,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:34,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:55:34,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24230113] [2024-11-12 00:55:34,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:34,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:55:34,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:34,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:55:34,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:55:34,514 INFO L87 Difference]: Start difference. First operand 28737 states and 41815 transitions. Second operand has 7 states, 7 states have (on average 52.57142857142857) internal successors, (368), 7 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:34,659 INFO L93 Difference]: Finished difference Result 53293 states and 77581 transitions. [2024-11-12 00:55:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:55:34,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.57142857142857) internal successors, (368), 7 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2024-11-12 00:55:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:34,693 INFO L225 Difference]: With dead ends: 53293 [2024-11-12 00:55:34,693 INFO L226 Difference]: Without dead ends: 29881 [2024-11-12 00:55:34,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:55:34,714 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 11 mSDsluCounter, 4763 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 5719 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:34,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 5719 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:55:34,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29881 states. [2024-11-12 00:55:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29881 to 29441. [2024-11-12 00:55:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29441 states, 29440 states have (on average 1.453226902173913) internal successors, (42783), 29440 states have internal predecessors, (42783), 0 states have call successors, (0), 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-12 00:55:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29441 states to 29441 states and 42783 transitions. [2024-11-12 00:55:34,970 INFO L78 Accepts]: Start accepts. Automaton has 29441 states and 42783 transitions. Word has length 368 [2024-11-12 00:55:34,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:34,970 INFO L471 AbstractCegarLoop]: Abstraction has 29441 states and 42783 transitions. [2024-11-12 00:55:34,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.57142857142857) internal successors, (368), 7 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 29441 states and 42783 transitions. [2024-11-12 00:55:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-12 00:55:34,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:34,991 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:34,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-12 00:55:34,991 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:34,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:34,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1821485106, now seen corresponding path program 1 times [2024-11-12 00:55:34,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:34,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303995544] [2024-11-12 00:55:34,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:34,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:35,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:35,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303995544] [2024-11-12 00:55:35,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303995544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:35,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:35,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:55:35,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262625962] [2024-11-12 00:55:35,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:35,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:55:35,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:35,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:55:35,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:55:35,622 INFO L87 Difference]: Start difference. First operand 29441 states and 42783 transitions. Second operand has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:35,743 INFO L93 Difference]: Finished difference Result 53077 states and 77237 transitions. [2024-11-12 00:55:35,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:55:35,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2024-11-12 00:55:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:35,776 INFO L225 Difference]: With dead ends: 53077 [2024-11-12 00:55:35,776 INFO L226 Difference]: Without dead ends: 29793 [2024-11-12 00:55:35,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:55:35,800 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 0 mSDsluCounter, 2873 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3836 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:35,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3836 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:55:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2024-11-12 00:55:35,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 29793. [2024-11-12 00:55:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29793 states, 29792 states have (on average 1.4478719119226637) internal successors, (43135), 29792 states have internal predecessors, (43135), 0 states have call successors, (0), 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-12 00:55:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29793 states to 29793 states and 43135 transitions. [2024-11-12 00:55:36,055 INFO L78 Accepts]: Start accepts. Automaton has 29793 states and 43135 transitions. Word has length 368 [2024-11-12 00:55:36,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:36,055 INFO L471 AbstractCegarLoop]: Abstraction has 29793 states and 43135 transitions. [2024-11-12 00:55:36,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 29793 states and 43135 transitions. [2024-11-12 00:55:36,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-12 00:55:36,076 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:36,076 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:36,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-12 00:55:36,077 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:36,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:36,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1928129415, now seen corresponding path program 1 times [2024-11-12 00:55:36,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:36,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822833241] [2024-11-12 00:55:36,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:36,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:36,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:36,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822833241] [2024-11-12 00:55:36,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822833241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:36,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:36,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:55:36,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116545502] [2024-11-12 00:55:36,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:36,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:55:36,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:36,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:55:36,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:55:36,755 INFO L87 Difference]: Start difference. First operand 29793 states and 43135 transitions. Second operand has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:36,885 INFO L93 Difference]: Finished difference Result 56037 states and 81157 transitions. [2024-11-12 00:55:36,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:55:36,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2024-11-12 00:55:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:36,924 INFO L225 Difference]: With dead ends: 56037 [2024-11-12 00:55:36,925 INFO L226 Difference]: Without dead ends: 30145 [2024-11-12 00:55:36,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:55:36,950 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 0 mSDsluCounter, 2873 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3836 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:36,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3836 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:55:36,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30145 states. [2024-11-12 00:55:37,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30145 to 30145. [2024-11-12 00:55:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30145 states, 30144 states have (on average 1.4426419851380043) internal successors, (43487), 30144 states have internal predecessors, (43487), 0 states have call successors, (0), 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-12 00:55:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30145 states to 30145 states and 43487 transitions. [2024-11-12 00:55:37,249 INFO L78 Accepts]: Start accepts. Automaton has 30145 states and 43487 transitions. Word has length 368 [2024-11-12 00:55:37,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:37,249 INFO L471 AbstractCegarLoop]: Abstraction has 30145 states and 43487 transitions. [2024-11-12 00:55:37,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 30145 states and 43487 transitions. [2024-11-12 00:55:37,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-12 00:55:37,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:37,272 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:37,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-12 00:55:37,272 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:37,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1824970383, now seen corresponding path program 1 times [2024-11-12 00:55:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:37,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206619007] [2024-11-12 00:55:37,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:37,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:37,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:37,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206619007] [2024-11-12 00:55:37,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206619007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:37,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:37,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:55:37,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742882087] [2024-11-12 00:55:37,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:37,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:55:37,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:37,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:55:37,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:55:37,876 INFO L87 Difference]: Start difference. First operand 30145 states and 43487 transitions. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:37,993 INFO L93 Difference]: Finished difference Result 57733 states and 83245 transitions. [2024-11-12 00:55:37,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:55:37,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2024-11-12 00:55:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:38,026 INFO L225 Difference]: With dead ends: 57733 [2024-11-12 00:55:38,027 INFO L226 Difference]: Without dead ends: 30321 [2024-11-12 00:55:38,050 INFO L434 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-12 00:55:38,051 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 0 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:38,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2879 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:55:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30321 states. [2024-11-12 00:55:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30321 to 30321. [2024-11-12 00:55:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30321 states, 30320 states have (on average 1.4400725593667547) internal successors, (43663), 30320 states have internal predecessors, (43663), 0 states have call successors, (0), 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-12 00:55:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30321 states to 30321 states and 43663 transitions. [2024-11-12 00:55:38,330 INFO L78 Accepts]: Start accepts. Automaton has 30321 states and 43663 transitions. Word has length 368 [2024-11-12 00:55:38,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:38,330 INFO L471 AbstractCegarLoop]: Abstraction has 30321 states and 43663 transitions. [2024-11-12 00:55:38,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 30321 states and 43663 transitions. [2024-11-12 00:55:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-12 00:55:38,352 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:38,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:38,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-12 00:55:38,353 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:38,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1285074229, now seen corresponding path program 1 times [2024-11-12 00:55:38,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:38,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020961484] [2024-11-12 00:55:38,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:38,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:39,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:39,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020961484] [2024-11-12 00:55:39,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020961484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:39,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:39,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 00:55:39,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866013965] [2024-11-12 00:55:39,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:39,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 00:55:39,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:39,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 00:55:39,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:55:39,899 INFO L87 Difference]: Start difference. First operand 30321 states and 43663 transitions. Second operand has 9 states, 9 states have (on average 40.888888888888886) internal successors, (368), 9 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:40,120 INFO L93 Difference]: Finished difference Result 78693 states and 113245 transitions. [2024-11-12 00:55:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:55:40,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 40.888888888888886) internal successors, (368), 9 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2024-11-12 00:55:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:40,177 INFO L225 Difference]: With dead ends: 78693 [2024-11-12 00:55:40,178 INFO L226 Difference]: Without dead ends: 50737 [2024-11-12 00:55:40,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:55:40,209 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 1450 mSDsluCounter, 5724 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 6683 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:40,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 6683 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:55:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50737 states. [2024-11-12 00:55:40,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50737 to 30519. [2024-11-12 00:55:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30519 states, 30518 states have (on average 1.4393800380103545) internal successors, (43927), 30518 states have internal predecessors, (43927), 0 states have call successors, (0), 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-12 00:55:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30519 states to 30519 states and 43927 transitions. [2024-11-12 00:55:40,651 INFO L78 Accepts]: Start accepts. Automaton has 30519 states and 43927 transitions. Word has length 368 [2024-11-12 00:55:40,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:40,651 INFO L471 AbstractCegarLoop]: Abstraction has 30519 states and 43927 transitions. [2024-11-12 00:55:40,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 40.888888888888886) internal successors, (368), 9 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 00:55:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 30519 states and 43927 transitions. [2024-11-12 00:55:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-12 00:55:40,671 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:40,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:40,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-12 00:55:40,672 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:40,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash 541211268, now seen corresponding path program 1 times [2024-11-12 00:55:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:40,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659290292] [2024-11-12 00:55:40,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:40,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms