./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb34721bf39b8c345e8997284756581f81ddbf5d57990eeac4742dbd2546fd8d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:50:10,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:50:10,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:50:10,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:50:10,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:50:10,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:50:10,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:50:10,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:50:10,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:50:10,981 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:50:10,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:50:10,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:50:10,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:50:10,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:50:10,982 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:50:10,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:50:10,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:50:10,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:50:10,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:50:10,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:50:10,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:50:10,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:50:10,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:50:10,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:50:10,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:50:10,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:50:10,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:50:10,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:50:10,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:50:10,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:50:10,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:50:10,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:50:10,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:50:10,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:50:10,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:50:10,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:50:10,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:50:10,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:50:10,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:50:10,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:50:10,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:50:10,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:50:10,996 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb34721bf39b8c345e8997284756581f81ddbf5d57990eeac4742dbd2546fd8d [2024-10-24 01:50:11,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:50:11,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:50:11,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:50:11,283 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:50:11,283 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:50:11,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2024-10-24 01:50:12,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:50:12,944 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:50:12,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2024-10-24 01:50:12,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cd44bffa/d757777f13cd405eb1ae398dc70399b5/FLAGb831d11b7 [2024-10-24 01:50:12,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cd44bffa/d757777f13cd405eb1ae398dc70399b5 [2024-10-24 01:50:12,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:50:12,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:50:12,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:50:12,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:50:12,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:50:12,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:50:12" (1/1) ... [2024-10-24 01:50:12,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@421868e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:12, skipping insertion in model container [2024-10-24 01:50:12,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:50:12" (1/1) ... [2024-10-24 01:50:13,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:50:13,292 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[7979,7992] [2024-10-24 01:50:13,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:50:13,357 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:50:13,406 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[7979,7992] [2024-10-24 01:50:13,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:50:13,464 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:50:13,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:13 WrapperNode [2024-10-24 01:50:13,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:50:13,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:50:13,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:50:13,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:50:13,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:13" (1/1) ... [2024-10-24 01:50:13,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:13" (1/1) ... [2024-10-24 01:50:13,525 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 686 [2024-10-24 01:50:13,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:50:13,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:50:13,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:50:13,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:50:13,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:13" (1/1) ... [2024-10-24 01:50:13,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:13" (1/1) ... [2024-10-24 01:50:13,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:13" (1/1) ... [2024-10-24 01:50:13,577 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 01:50:13,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:13" (1/1) ... [2024-10-24 01:50:13,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:13" (1/1) ... [2024-10-24 01:50:13,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:13" (1/1) ... [2024-10-24 01:50:13,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:13" (1/1) ... [2024-10-24 01:50:13,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:13" (1/1) ... [2024-10-24 01:50:13,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:13" (1/1) ... [2024-10-24 01:50:13,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:50:13,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:50:13,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:50:13,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:50:13,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:13" (1/1) ... [2024-10-24 01:50:13,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:50:13,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:50:13,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:50:13,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:50:13,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:50:13,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:50:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:50:13,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:50:13,820 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:50:13,822 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:50:14,457 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-24 01:50:14,458 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:50:14,509 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:50:14,509 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:50:14,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:50:14 BoogieIcfgContainer [2024-10-24 01:50:14,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:50:14,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:50:14,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:50:14,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:50:14,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:50:12" (1/3) ... [2024-10-24 01:50:14,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fd3378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:50:14, skipping insertion in model container [2024-10-24 01:50:14,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:13" (2/3) ... [2024-10-24 01:50:14,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fd3378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:50:14, skipping insertion in model container [2024-10-24 01:50:14,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:50:14" (3/3) ... [2024-10-24 01:50:14,520 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2024-10-24 01:50:14,538 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:50:14,538 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:50:14,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:50:14,605 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;@10b35c63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:50:14,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:50:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 146 states have (on average 1.7671232876712328) internal successors, (258), 147 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 01:50:14,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:14,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:14,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:14,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:14,629 INFO L85 PathProgramCache]: Analyzing trace with hash -819391528, now seen corresponding path program 1 times [2024-10-24 01:50:14,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:14,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919042135] [2024-10-24 01:50:14,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:14,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:15,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:15,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919042135] [2024-10-24 01:50:15,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919042135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:15,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:15,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:15,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615621906] [2024-10-24 01:50:15,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:15,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:15,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:15,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:15,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:15,372 INFO L87 Difference]: Start difference. First operand has 148 states, 146 states have (on average 1.7671232876712328) internal successors, (258), 147 states have internal predecessors, (258), 0 states have call successors, (0), 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 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:15,865 INFO L93 Difference]: Finished difference Result 833 states and 1343 transitions. [2024-10-24 01:50:15,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:15,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-24 01:50:15,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:15,892 INFO L225 Difference]: With dead ends: 833 [2024-10-24 01:50:15,893 INFO L226 Difference]: Without dead ends: 750 [2024-10-24 01:50:15,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-24 01:50:15,902 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 1628 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:15,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 1832 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:50:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-10-24 01:50:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 226. [2024-10-24 01:50:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.4533333333333334) internal successors, (327), 225 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2024-10-24 01:50:15,987 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 75 [2024-10-24 01:50:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:15,987 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2024-10-24 01:50:15,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2024-10-24 01:50:15,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:50:15,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:15,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:15,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:50:15,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:15,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash 57964953, now seen corresponding path program 1 times [2024-10-24 01:50:15,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:15,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781222854] [2024-10-24 01:50:15,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:15,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:16,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:16,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781222854] [2024-10-24 01:50:16,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781222854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:16,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:16,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:16,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081940824] [2024-10-24 01:50:16,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:16,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:16,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:16,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:16,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:16,299 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:16,486 INFO L93 Difference]: Finished difference Result 921 states and 1418 transitions. [2024-10-24 01:50:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:16,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:50:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:16,490 INFO L225 Difference]: With dead ends: 921 [2024-10-24 01:50:16,490 INFO L226 Difference]: Without dead ends: 801 [2024-10-24 01:50:16,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:16,494 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 1023 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:16,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1238 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:16,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-10-24 01:50:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 355. [2024-10-24 01:50:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.5) internal successors, (531), 354 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 531 transitions. [2024-10-24 01:50:16,526 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 531 transitions. Word has length 77 [2024-10-24 01:50:16,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:16,528 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 531 transitions. [2024-10-24 01:50:16,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 531 transitions. [2024-10-24 01:50:16,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:50:16,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:16,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:16,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:50:16,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:16,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:16,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1841121089, now seen corresponding path program 1 times [2024-10-24 01:50:16,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:16,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442896743] [2024-10-24 01:50:16,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:16,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442896743] [2024-10-24 01:50:16,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442896743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:16,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:16,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:16,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620472639] [2024-10-24 01:50:16,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:16,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:16,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:16,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:16,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:16,802 INFO L87 Difference]: Start difference. First operand 355 states and 531 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:16,961 INFO L93 Difference]: Finished difference Result 1045 states and 1614 transitions. [2024-10-24 01:50:16,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:16,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:50:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:16,965 INFO L225 Difference]: With dead ends: 1045 [2024-10-24 01:50:16,966 INFO L226 Difference]: Without dead ends: 925 [2024-10-24 01:50:16,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:16,969 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 1287 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:16,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 1048 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-10-24 01:50:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 538. [2024-10-24 01:50:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.5270018621973929) internal successors, (820), 537 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 820 transitions. [2024-10-24 01:50:16,996 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 820 transitions. Word has length 77 [2024-10-24 01:50:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:16,997 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 820 transitions. [2024-10-24 01:50:16,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 820 transitions. [2024-10-24 01:50:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:50:17,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:17,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:17,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:50:17,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:17,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash 836086966, now seen corresponding path program 1 times [2024-10-24 01:50:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51200973] [2024-10-24 01:50:17,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:17,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:17,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:17,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51200973] [2024-10-24 01:50:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51200973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:17,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:17,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067871961] [2024-10-24 01:50:17,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:17,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:17,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:17,403 INFO L87 Difference]: Start difference. First operand 538 states and 820 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:17,605 INFO L93 Difference]: Finished difference Result 955 states and 1477 transitions. [2024-10-24 01:50:17,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:17,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:50:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:17,609 INFO L225 Difference]: With dead ends: 955 [2024-10-24 01:50:17,609 INFO L226 Difference]: Without dead ends: 540 [2024-10-24 01:50:17,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:50:17,611 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 484 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:17,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 679 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-10-24 01:50:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2024-10-24 01:50:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.5195530726256983) internal successors, (816), 537 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 816 transitions. [2024-10-24 01:50:17,626 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 816 transitions. Word has length 77 [2024-10-24 01:50:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:17,627 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 816 transitions. [2024-10-24 01:50:17,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 816 transitions. [2024-10-24 01:50:17,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:50:17,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:17,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:17,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:50:17,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:17,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:17,633 INFO L85 PathProgramCache]: Analyzing trace with hash 629188471, now seen corresponding path program 1 times [2024-10-24 01:50:17,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:17,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577251879] [2024-10-24 01:50:17,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:17,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:17,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:17,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577251879] [2024-10-24 01:50:17,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577251879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:17,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:17,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:50:17,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536894710] [2024-10-24 01:50:17,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:17,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:50:17,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:17,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:50:17,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:17,722 INFO L87 Difference]: Start difference. First operand 538 states and 816 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:17,750 INFO L93 Difference]: Finished difference Result 1323 states and 2045 transitions. [2024-10-24 01:50:17,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:50:17,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:50:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:17,756 INFO L225 Difference]: With dead ends: 1323 [2024-10-24 01:50:17,756 INFO L226 Difference]: Without dead ends: 908 [2024-10-24 01:50:17,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:17,759 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 83 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:17,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 468 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:17,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-10-24 01:50:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 906. [2024-10-24 01:50:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 905 states have (on average 1.5226519337016575) internal successors, (1378), 905 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1378 transitions. [2024-10-24 01:50:17,783 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1378 transitions. Word has length 77 [2024-10-24 01:50:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:17,784 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1378 transitions. [2024-10-24 01:50:17,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1378 transitions. [2024-10-24 01:50:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:50:17,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:17,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:17,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:50:17,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:17,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:17,788 INFO L85 PathProgramCache]: Analyzing trace with hash 644914821, now seen corresponding path program 1 times [2024-10-24 01:50:17,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:17,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287488105] [2024-10-24 01:50:17,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:17,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:17,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287488105] [2024-10-24 01:50:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287488105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:17,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:17,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:17,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263851216] [2024-10-24 01:50:17,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:17,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:17,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:17,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:17,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:17,985 INFO L87 Difference]: Start difference. First operand 906 states and 1378 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:18,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:18,187 INFO L93 Difference]: Finished difference Result 2057 states and 3160 transitions. [2024-10-24 01:50:18,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:18,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:50:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:18,195 INFO L225 Difference]: With dead ends: 2057 [2024-10-24 01:50:18,196 INFO L226 Difference]: Without dead ends: 1832 [2024-10-24 01:50:18,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:18,198 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 1032 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:18,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 1385 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2024-10-24 01:50:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1130. [2024-10-24 01:50:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 1.5279007971656333) internal successors, (1725), 1129 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1725 transitions. [2024-10-24 01:50:18,233 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1725 transitions. Word has length 77 [2024-10-24 01:50:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:18,233 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1725 transitions. [2024-10-24 01:50:18,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1725 transitions. [2024-10-24 01:50:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:50:18,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:18,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:18,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:50:18,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:18,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:18,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1731630291, now seen corresponding path program 1 times [2024-10-24 01:50:18,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:18,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552559264] [2024-10-24 01:50:18,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:18,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:18,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:18,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552559264] [2024-10-24 01:50:18,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552559264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:18,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:18,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:18,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421526359] [2024-10-24 01:50:18,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:18,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:18,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:18,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:18,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:18,395 INFO L87 Difference]: Start difference. First operand 1130 states and 1725 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:18,567 INFO L93 Difference]: Finished difference Result 2291 states and 3523 transitions. [2024-10-24 01:50:18,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:18,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:50:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:18,574 INFO L225 Difference]: With dead ends: 2291 [2024-10-24 01:50:18,574 INFO L226 Difference]: Without dead ends: 2066 [2024-10-24 01:50:18,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:18,576 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1074 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:18,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1687 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:18,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2024-10-24 01:50:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1369. [2024-10-24 01:50:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1368 states have (on average 1.5321637426900585) internal successors, (2096), 1368 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2096 transitions. [2024-10-24 01:50:18,611 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2096 transitions. Word has length 77 [2024-10-24 01:50:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:18,611 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2096 transitions. [2024-10-24 01:50:18,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2096 transitions. [2024-10-24 01:50:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:50:18,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:18,612 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:18,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:50:18,612 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:18,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash 294962861, now seen corresponding path program 1 times [2024-10-24 01:50:18,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:18,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904032640] [2024-10-24 01:50:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:18,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:18,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:18,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904032640] [2024-10-24 01:50:18,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904032640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:18,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:18,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:18,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223742554] [2024-10-24 01:50:18,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:18,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:18,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:18,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:18,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:18,799 INFO L87 Difference]: Start difference. First operand 1369 states and 2096 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:18,955 INFO L93 Difference]: Finished difference Result 2530 states and 3894 transitions. [2024-10-24 01:50:18,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:18,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:50:18,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:18,963 INFO L225 Difference]: With dead ends: 2530 [2024-10-24 01:50:18,963 INFO L226 Difference]: Without dead ends: 2305 [2024-10-24 01:50:18,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:18,966 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1084 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:18,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1241 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2024-10-24 01:50:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 1608. [2024-10-24 01:50:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 1.5351586807716242) internal successors, (2467), 1607 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2467 transitions. [2024-10-24 01:50:19,011 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2467 transitions. Word has length 77 [2024-10-24 01:50:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:19,011 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2467 transitions. [2024-10-24 01:50:19,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2467 transitions. [2024-10-24 01:50:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:50:19,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:19,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:19,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:50:19,013 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:19,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash 146982893, now seen corresponding path program 1 times [2024-10-24 01:50:19,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:19,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75432036] [2024-10-24 01:50:19,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:19,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:19,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:19,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75432036] [2024-10-24 01:50:19,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75432036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:19,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:19,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:19,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260340062] [2024-10-24 01:50:19,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:19,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:19,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:19,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:19,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:19,121 INFO L87 Difference]: Start difference. First operand 1608 states and 2467 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:19,247 INFO L93 Difference]: Finished difference Result 3179 states and 4896 transitions. [2024-10-24 01:50:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:19,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:50:19,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:19,253 INFO L225 Difference]: With dead ends: 3179 [2024-10-24 01:50:19,253 INFO L226 Difference]: Without dead ends: 1608 [2024-10-24 01:50:19,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:19,255 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 554 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:19,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 108 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2024-10-24 01:50:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2024-10-24 01:50:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 1.5183571873055384) internal successors, (2440), 1607 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2440 transitions. [2024-10-24 01:50:19,284 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2440 transitions. Word has length 78 [2024-10-24 01:50:19,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:19,285 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2440 transitions. [2024-10-24 01:50:19,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2440 transitions. [2024-10-24 01:50:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:50:19,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:19,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:19,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:50:19,286 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:19,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash 645222420, now seen corresponding path program 1 times [2024-10-24 01:50:19,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:19,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405766388] [2024-10-24 01:50:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:19,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:19,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:19,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405766388] [2024-10-24 01:50:19,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405766388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:19,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:19,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:19,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522996621] [2024-10-24 01:50:19,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:19,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:19,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:19,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:19,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:19,430 INFO L87 Difference]: Start difference. First operand 1608 states and 2440 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:19,557 INFO L93 Difference]: Finished difference Result 3163 states and 4823 transitions. [2024-10-24 01:50:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:19,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:50:19,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:19,563 INFO L225 Difference]: With dead ends: 3163 [2024-10-24 01:50:19,563 INFO L226 Difference]: Without dead ends: 1608 [2024-10-24 01:50:19,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:19,567 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 503 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:19,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 140 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:19,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2024-10-24 01:50:19,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2024-10-24 01:50:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 1.5015556938394523) internal successors, (2413), 1607 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2413 transitions. [2024-10-24 01:50:19,599 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2413 transitions. Word has length 79 [2024-10-24 01:50:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:19,600 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2413 transitions. [2024-10-24 01:50:19,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2413 transitions. [2024-10-24 01:50:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:19,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:19,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:19,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:50:19,601 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:19,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1184482509, now seen corresponding path program 1 times [2024-10-24 01:50:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:19,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702158379] [2024-10-24 01:50:19,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:19,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:19,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:19,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702158379] [2024-10-24 01:50:19,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702158379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:19,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:19,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:19,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956036929] [2024-10-24 01:50:19,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:19,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:19,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:19,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:19,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:19,712 INFO L87 Difference]: Start difference. First operand 1608 states and 2413 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:19,837 INFO L93 Difference]: Finished difference Result 3171 states and 4779 transitions. [2024-10-24 01:50:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:19,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-24 01:50:19,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:19,843 INFO L225 Difference]: With dead ends: 3171 [2024-10-24 01:50:19,843 INFO L226 Difference]: Without dead ends: 1608 [2024-10-24 01:50:19,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:19,846 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 519 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:19,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 124 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2024-10-24 01:50:19,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2024-10-24 01:50:19,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 1.4847542003733665) internal successors, (2386), 1607 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2386 transitions. [2024-10-24 01:50:19,877 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2386 transitions. Word has length 80 [2024-10-24 01:50:19,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:19,877 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2386 transitions. [2024-10-24 01:50:19,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2386 transitions. [2024-10-24 01:50:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:50:19,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:19,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:19,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:50:19,879 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:19,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:19,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1700139828, now seen corresponding path program 1 times [2024-10-24 01:50:19,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:19,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215273663] [2024-10-24 01:50:19,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:19,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:20,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:20,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215273663] [2024-10-24 01:50:20,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215273663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:20,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:20,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:20,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576903342] [2024-10-24 01:50:20,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:20,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:20,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:20,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:20,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:20,007 INFO L87 Difference]: Start difference. First operand 1608 states and 2386 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:20,129 INFO L93 Difference]: Finished difference Result 3167 states and 4721 transitions. [2024-10-24 01:50:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:20,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-24 01:50:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:20,134 INFO L225 Difference]: With dead ends: 3167 [2024-10-24 01:50:20,134 INFO L226 Difference]: Without dead ends: 1608 [2024-10-24 01:50:20,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:20,137 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 501 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:20,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 132 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:20,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2024-10-24 01:50:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2024-10-24 01:50:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 1.4679527069072806) internal successors, (2359), 1607 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2359 transitions. [2024-10-24 01:50:20,164 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2359 transitions. Word has length 81 [2024-10-24 01:50:20,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:20,164 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2359 transitions. [2024-10-24 01:50:20,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2359 transitions. [2024-10-24 01:50:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 01:50:20,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:20,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:20,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:50:20,166 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:20,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash -940668639, now seen corresponding path program 1 times [2024-10-24 01:50:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:20,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597127784] [2024-10-24 01:50:20,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:20,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:20,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597127784] [2024-10-24 01:50:20,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597127784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:20,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:20,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714486867] [2024-10-24 01:50:20,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:20,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:20,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:20,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:20,273 INFO L87 Difference]: Start difference. First operand 1608 states and 2359 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:20,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:20,398 INFO L93 Difference]: Finished difference Result 3175 states and 4676 transitions. [2024-10-24 01:50:20,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:20,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-24 01:50:20,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:20,403 INFO L225 Difference]: With dead ends: 3175 [2024-10-24 01:50:20,403 INFO L226 Difference]: Without dead ends: 1608 [2024-10-24 01:50:20,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:20,406 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 518 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:20,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 116 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:20,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2024-10-24 01:50:20,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2024-10-24 01:50:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 1.4511512134411948) internal successors, (2332), 1607 states have internal predecessors, (2332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2332 transitions. [2024-10-24 01:50:20,434 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2332 transitions. Word has length 82 [2024-10-24 01:50:20,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:20,434 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2332 transitions. [2024-10-24 01:50:20,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2332 transitions. [2024-10-24 01:50:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 01:50:20,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:20,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:20,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:50:20,436 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:20,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:20,437 INFO L85 PathProgramCache]: Analyzing trace with hash -659470276, now seen corresponding path program 1 times [2024-10-24 01:50:20,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:20,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807069356] [2024-10-24 01:50:20,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:20,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:20,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:20,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807069356] [2024-10-24 01:50:20,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807069356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:20,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:20,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:50:20,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616202929] [2024-10-24 01:50:20,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:20,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:20,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:20,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:20,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:20,726 INFO L87 Difference]: Start difference. First operand 1608 states and 2332 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:20,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:20,761 INFO L93 Difference]: Finished difference Result 1622 states and 2351 transitions. [2024-10-24 01:50:20,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:20,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-24 01:50:20,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:20,766 INFO L225 Difference]: With dead ends: 1622 [2024-10-24 01:50:20,766 INFO L226 Difference]: Without dead ends: 1620 [2024-10-24 01:50:20,767 INFO L431 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-10-24 01:50:20,768 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:20,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 736 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2024-10-24 01:50:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1620. [2024-10-24 01:50:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1619 states have (on average 1.4434836318715256) internal successors, (2337), 1619 states have internal predecessors, (2337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2337 transitions. [2024-10-24 01:50:20,794 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2337 transitions. Word has length 83 [2024-10-24 01:50:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:20,794 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2337 transitions. [2024-10-24 01:50:20,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2337 transitions. [2024-10-24 01:50:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 01:50:20,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:20,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:20,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:50:20,796 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:20,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:20,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1714989240, now seen corresponding path program 1 times [2024-10-24 01:50:20,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:20,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740737149] [2024-10-24 01:50:20,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:20,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:21,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:21,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740737149] [2024-10-24 01:50:21,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740737149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:21,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:21,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:50:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953653345] [2024-10-24 01:50:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:21,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:50:21,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:21,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:50:21,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:50:21,277 INFO L87 Difference]: Start difference. First operand 1620 states and 2337 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:21,885 INFO L93 Difference]: Finished difference Result 4637 states and 6695 transitions. [2024-10-24 01:50:21,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:50:21,885 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-24 01:50:21,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:21,895 INFO L225 Difference]: With dead ends: 4637 [2024-10-24 01:50:21,896 INFO L226 Difference]: Without dead ends: 3167 [2024-10-24 01:50:21,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-10-24 01:50:21,900 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 592 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:21,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 560 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:50:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3167 states. [2024-10-24 01:50:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3167 to 1620. [2024-10-24 01:50:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1619 states have (on average 1.4397776405188387) internal successors, (2331), 1619 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2331 transitions. [2024-10-24 01:50:21,934 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2331 transitions. Word has length 83 [2024-10-24 01:50:21,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:21,934 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2331 transitions. [2024-10-24 01:50:21,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2331 transitions. [2024-10-24 01:50:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 01:50:21,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:21,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:21,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:50:21,936 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:21,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:21,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1554308713, now seen corresponding path program 1 times [2024-10-24 01:50:21,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:21,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198864210] [2024-10-24 01:50:21,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:21,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:22,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:22,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198864210] [2024-10-24 01:50:22,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198864210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:22,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:22,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:50:22,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670516197] [2024-10-24 01:50:22,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:22,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:50:22,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:22,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:50:22,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:50:22,390 INFO L87 Difference]: Start difference. First operand 1620 states and 2331 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:23,011 INFO L93 Difference]: Finished difference Result 4682 states and 6751 transitions. [2024-10-24 01:50:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:50:23,012 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-24 01:50:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:23,024 INFO L225 Difference]: With dead ends: 4682 [2024-10-24 01:50:23,024 INFO L226 Difference]: Without dead ends: 3187 [2024-10-24 01:50:23,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-10-24 01:50:23,028 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 848 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:23,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 633 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:50:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states. [2024-10-24 01:50:23,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 1620. [2024-10-24 01:50:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1619 states have (on average 1.4366893143915997) internal successors, (2326), 1619 states have internal predecessors, (2326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2326 transitions. [2024-10-24 01:50:23,060 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2326 transitions. Word has length 84 [2024-10-24 01:50:23,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:23,061 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2326 transitions. [2024-10-24 01:50:23,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2326 transitions. [2024-10-24 01:50:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 01:50:23,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:23,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:23,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:50:23,062 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:23,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:23,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1633213121, now seen corresponding path program 1 times [2024-10-24 01:50:23,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:23,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337595776] [2024-10-24 01:50:23,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:23,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:23,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:23,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337595776] [2024-10-24 01:50:23,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337595776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:23,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:23,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:23,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276395972] [2024-10-24 01:50:23,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:23,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:23,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:23,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:23,384 INFO L87 Difference]: Start difference. First operand 1620 states and 2326 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:23,761 INFO L93 Difference]: Finished difference Result 4620 states and 6679 transitions. [2024-10-24 01:50:23,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:50:23,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-24 01:50:23,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:23,767 INFO L225 Difference]: With dead ends: 4620 [2024-10-24 01:50:23,767 INFO L226 Difference]: Without dead ends: 3090 [2024-10-24 01:50:23,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:23,770 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 671 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:23,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 484 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:50:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2024-10-24 01:50:23,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 1620. [2024-10-24 01:50:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1619 states have (on average 1.436071649166152) internal successors, (2325), 1619 states have internal predecessors, (2325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2325 transitions. [2024-10-24 01:50:23,799 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2325 transitions. Word has length 84 [2024-10-24 01:50:23,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:23,799 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2325 transitions. [2024-10-24 01:50:23,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2325 transitions. [2024-10-24 01:50:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 01:50:23,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:23,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:23,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:50:23,801 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:23,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:23,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1569569178, now seen corresponding path program 1 times [2024-10-24 01:50:23,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:23,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337355150] [2024-10-24 01:50:23,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:23,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:24,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:24,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337355150] [2024-10-24 01:50:24,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337355150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:24,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:24,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 01:50:24,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453490593] [2024-10-24 01:50:24,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:24,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:50:24,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:24,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:50:24,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:50:24,238 INFO L87 Difference]: Start difference. First operand 1620 states and 2325 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:24,816 INFO L93 Difference]: Finished difference Result 4754 states and 6823 transitions. [2024-10-24 01:50:24,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:50:24,816 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-24 01:50:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:24,826 INFO L225 Difference]: With dead ends: 4754 [2024-10-24 01:50:24,827 INFO L226 Difference]: Without dead ends: 3255 [2024-10-24 01:50:24,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2024-10-24 01:50:24,834 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 1145 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:24,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 635 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:50:24,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2024-10-24 01:50:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 1626. [2024-10-24 01:50:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1625 states have (on average 1.4344615384615385) internal successors, (2331), 1625 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2331 transitions. [2024-10-24 01:50:24,865 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2331 transitions. Word has length 85 [2024-10-24 01:50:24,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:24,866 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 2331 transitions. [2024-10-24 01:50:24,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:24,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2331 transitions. [2024-10-24 01:50:24,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 01:50:24,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:24,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:24,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:50:24,867 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:24,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:24,868 INFO L85 PathProgramCache]: Analyzing trace with hash 662143390, now seen corresponding path program 1 times [2024-10-24 01:50:24,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:24,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411031265] [2024-10-24 01:50:24,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:24,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:25,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:25,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411031265] [2024-10-24 01:50:25,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411031265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:25,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:25,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:50:25,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361804431] [2024-10-24 01:50:25,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:25,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:50:25,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:25,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:50:25,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:25,368 INFO L87 Difference]: Start difference. First operand 1626 states and 2331 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:26,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:26,336 INFO L93 Difference]: Finished difference Result 5715 states and 8237 transitions. [2024-10-24 01:50:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:50:26,336 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-24 01:50:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:26,342 INFO L225 Difference]: With dead ends: 5715 [2024-10-24 01:50:26,342 INFO L226 Difference]: Without dead ends: 4190 [2024-10-24 01:50:26,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:50:26,344 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 733 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:26,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1282 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:50:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2024-10-24 01:50:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 1620. [2024-10-24 01:50:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1619 states have (on average 1.4348363187152564) internal successors, (2323), 1619 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2323 transitions. [2024-10-24 01:50:26,375 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2323 transitions. Word has length 86 [2024-10-24 01:50:26,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:26,375 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2323 transitions. [2024-10-24 01:50:26,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2323 transitions. [2024-10-24 01:50:26,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 01:50:26,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:26,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:26,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:50:26,377 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:26,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:26,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1719979192, now seen corresponding path program 1 times [2024-10-24 01:50:26,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:26,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074695092] [2024-10-24 01:50:26,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:26,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:26,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:26,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074695092] [2024-10-24 01:50:26,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074695092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:26,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:26,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:50:26,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548917630] [2024-10-24 01:50:26,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:26,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:50:26,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:26,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:50:26,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:50:26,730 INFO L87 Difference]: Start difference. First operand 1620 states and 2323 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:27,247 INFO L93 Difference]: Finished difference Result 4712 states and 6783 transitions. [2024-10-24 01:50:27,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:50:27,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-24 01:50:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:27,253 INFO L225 Difference]: With dead ends: 4712 [2024-10-24 01:50:27,254 INFO L226 Difference]: Without dead ends: 3197 [2024-10-24 01:50:27,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-10-24 01:50:27,257 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 393 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:27,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 799 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:50:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2024-10-24 01:50:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 1620. [2024-10-24 01:50:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1619 states have (on average 1.4323656578134651) internal successors, (2319), 1619 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2319 transitions. [2024-10-24 01:50:27,288 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2319 transitions. Word has length 86 [2024-10-24 01:50:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:27,288 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2319 transitions. [2024-10-24 01:50:27,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2319 transitions. [2024-10-24 01:50:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 01:50:27,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:27,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:27,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:50:27,289 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:27,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:27,290 INFO L85 PathProgramCache]: Analyzing trace with hash 294400252, now seen corresponding path program 1 times [2024-10-24 01:50:27,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:27,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574904543] [2024-10-24 01:50:27,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:27,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:27,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:27,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574904543] [2024-10-24 01:50:27,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574904543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:27,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:27,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 01:50:27,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656095815] [2024-10-24 01:50:27,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:27,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 01:50:27,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:27,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 01:50:28,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-24 01:50:28,000 INFO L87 Difference]: Start difference. First operand 1620 states and 2319 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:28,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:28,927 INFO L93 Difference]: Finished difference Result 6606 states and 9549 transitions. [2024-10-24 01:50:28,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:50:28,928 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-24 01:50:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:28,939 INFO L225 Difference]: With dead ends: 6606 [2024-10-24 01:50:28,940 INFO L226 Difference]: Without dead ends: 6132 [2024-10-24 01:50:28,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2024-10-24 01:50:28,945 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 821 mSDsluCounter, 2881 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:28,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 3330 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:50:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states. [2024-10-24 01:50:28,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 1609. [2024-10-24 01:50:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.4303482587064678) internal successors, (2300), 1608 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2300 transitions. [2024-10-24 01:50:28,991 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2300 transitions. Word has length 87 [2024-10-24 01:50:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:28,991 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2300 transitions. [2024-10-24 01:50:28,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2300 transitions. [2024-10-24 01:50:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 01:50:28,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:28,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:28,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:50:28,993 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:28,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash -175919843, now seen corresponding path program 1 times [2024-10-24 01:50:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:28,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772063766] [2024-10-24 01:50:28,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:28,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:31,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:31,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772063766] [2024-10-24 01:50:31,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772063766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:31,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:31,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2024-10-24 01:50:31,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905629390] [2024-10-24 01:50:31,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:31,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-24 01:50:31,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:31,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-24 01:50:31,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2024-10-24 01:50:31,445 INFO L87 Difference]: Start difference. First operand 1609 states and 2300 transitions. Second operand has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:35,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:35,934 INFO L93 Difference]: Finished difference Result 8064 states and 11657 transitions. [2024-10-24 01:50:35,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-24 01:50:35,935 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-24 01:50:35,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:35,948 INFO L225 Difference]: With dead ends: 8064 [2024-10-24 01:50:35,948 INFO L226 Difference]: Without dead ends: 7610 [2024-10-24 01:50:35,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=406, Invalid=2350, Unknown=0, NotChecked=0, Total=2756 [2024-10-24 01:50:35,952 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 1817 mSDsluCounter, 7610 mSDsCounter, 0 mSdLazyCounter, 4903 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 8025 SdHoareTripleChecker+Invalid, 4903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:35,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1817 Valid, 8025 Invalid, 4903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4903 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 01:50:35,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2024-10-24 01:50:35,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 1632. [2024-10-24 01:50:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1631 states have (on average 1.427958307786634) internal successors, (2329), 1631 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2329 transitions. [2024-10-24 01:50:35,998 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2329 transitions. Word has length 87 [2024-10-24 01:50:35,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:35,998 INFO L471 AbstractCegarLoop]: Abstraction has 1632 states and 2329 transitions. [2024-10-24 01:50:35,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:35,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2329 transitions. [2024-10-24 01:50:35,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 01:50:35,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:35,999 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:35,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:50:36,000 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:36,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:36,000 INFO L85 PathProgramCache]: Analyzing trace with hash -674427557, now seen corresponding path program 1 times [2024-10-24 01:50:36,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:36,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269487509] [2024-10-24 01:50:36,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:36,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:36,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:36,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269487509] [2024-10-24 01:50:36,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269487509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:36,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:36,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 01:50:36,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804458400] [2024-10-24 01:50:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:36,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:50:36,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:36,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:50:36,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:50:36,558 INFO L87 Difference]: Start difference. First operand 1632 states and 2329 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:37,115 INFO L93 Difference]: Finished difference Result 3579 states and 5154 transitions. [2024-10-24 01:50:37,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:50:37,116 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-24 01:50:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:37,133 INFO L225 Difference]: With dead ends: 3579 [2024-10-24 01:50:37,133 INFO L226 Difference]: Without dead ends: 3095 [2024-10-24 01:50:37,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-24 01:50:37,134 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 1000 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:37,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 1095 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2024-10-24 01:50:37,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 1606. [2024-10-24 01:50:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.4286604361370716) internal successors, (2293), 1605 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2293 transitions. [2024-10-24 01:50:37,156 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2293 transitions. Word has length 87 [2024-10-24 01:50:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:37,156 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2293 transitions. [2024-10-24 01:50:37,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2293 transitions. [2024-10-24 01:50:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 01:50:37,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:37,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:37,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 01:50:37,158 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:37,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:37,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1498021318, now seen corresponding path program 1 times [2024-10-24 01:50:37,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:37,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715831665] [2024-10-24 01:50:37,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:37,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:37,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:37,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715831665] [2024-10-24 01:50:37,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715831665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:37,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:37,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:50:37,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110232251] [2024-10-24 01:50:37,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:37,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:50:37,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:37,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:50:37,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:50:37,657 INFO L87 Difference]: Start difference. First operand 1606 states and 2293 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:38,153 INFO L93 Difference]: Finished difference Result 6480 states and 9368 transitions. [2024-10-24 01:50:38,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:50:38,153 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-24 01:50:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:38,164 INFO L225 Difference]: With dead ends: 6480 [2024-10-24 01:50:38,164 INFO L226 Difference]: Without dead ends: 6001 [2024-10-24 01:50:38,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2024-10-24 01:50:38,168 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 846 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:38,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 1902 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:38,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2024-10-24 01:50:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 1580. [2024-10-24 01:50:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1579 states have (on average 1.4300189993666879) internal successors, (2258), 1579 states have internal predecessors, (2258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2258 transitions. [2024-10-24 01:50:38,211 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2258 transitions. Word has length 87 [2024-10-24 01:50:38,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:38,211 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2258 transitions. [2024-10-24 01:50:38,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:38,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2258 transitions. [2024-10-24 01:50:38,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 01:50:38,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:38,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:38,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 01:50:38,213 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:38,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:38,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1804071413, now seen corresponding path program 1 times [2024-10-24 01:50:38,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:38,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946463189] [2024-10-24 01:50:38,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:38,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:38,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:38,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946463189] [2024-10-24 01:50:38,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946463189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:38,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:38,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 01:50:38,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819850798] [2024-10-24 01:50:38,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:38,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:50:38,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:38,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:50:38,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:50:38,853 INFO L87 Difference]: Start difference. First operand 1580 states and 2258 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:39,392 INFO L93 Difference]: Finished difference Result 3507 states and 5056 transitions. [2024-10-24 01:50:39,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:50:39,393 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-24 01:50:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:39,398 INFO L225 Difference]: With dead ends: 3507 [2024-10-24 01:50:39,398 INFO L226 Difference]: Without dead ends: 3053 [2024-10-24 01:50:39,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-24 01:50:39,400 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 643 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:39,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1834 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2024-10-24 01:50:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 1555. [2024-10-24 01:50:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1554 states have (on average 1.4317889317889319) internal successors, (2225), 1554 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2225 transitions. [2024-10-24 01:50:39,426 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2225 transitions. Word has length 88 [2024-10-24 01:50:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:39,426 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2225 transitions. [2024-10-24 01:50:39,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2225 transitions. [2024-10-24 01:50:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 01:50:39,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:39,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:39,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 01:50:39,428 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:39,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:39,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1383019005, now seen corresponding path program 1 times [2024-10-24 01:50:39,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:39,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974514899] [2024-10-24 01:50:39,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:39,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:39,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:39,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974514899] [2024-10-24 01:50:39,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974514899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:39,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:39,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:39,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739868492] [2024-10-24 01:50:39,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:39,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:50:39,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:39,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:50:39,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:50:39,553 INFO L87 Difference]: Start difference. First operand 1555 states and 2225 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:39,583 INFO L93 Difference]: Finished difference Result 3610 states and 5212 transitions. [2024-10-24 01:50:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:50:39,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-24 01:50:39,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:39,587 INFO L225 Difference]: With dead ends: 3610 [2024-10-24 01:50:39,587 INFO L226 Difference]: Without dead ends: 2146 [2024-10-24 01:50:39,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:50:39,590 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 88 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:39,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 501 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:39,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2024-10-24 01:50:39,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2144. [2024-10-24 01:50:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 2143 states have (on average 1.43117125524965) internal successors, (3067), 2143 states have internal predecessors, (3067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 3067 transitions. [2024-10-24 01:50:39,614 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 3067 transitions. Word has length 88 [2024-10-24 01:50:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:39,615 INFO L471 AbstractCegarLoop]: Abstraction has 2144 states and 3067 transitions. [2024-10-24 01:50:39,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 3067 transitions. [2024-10-24 01:50:39,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 01:50:39,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:39,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:39,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 01:50:39,616 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:39,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:39,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1330616519, now seen corresponding path program 1 times [2024-10-24 01:50:39,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:39,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746106409] [2024-10-24 01:50:39,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:39,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:41,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:41,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746106409] [2024-10-24 01:50:41,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746106409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:41,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:41,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2024-10-24 01:50:41,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617471666] [2024-10-24 01:50:41,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:41,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-24 01:50:41,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:41,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-24 01:50:41,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2024-10-24 01:50:41,333 INFO L87 Difference]: Start difference. First operand 2144 states and 3067 transitions. Second operand has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:45,509 INFO L93 Difference]: Finished difference Result 14558 states and 20998 transitions. [2024-10-24 01:50:45,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-24 01:50:45,510 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-24 01:50:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:45,526 INFO L225 Difference]: With dead ends: 14558 [2024-10-24 01:50:45,526 INFO L226 Difference]: Without dead ends: 12503 [2024-10-24 01:50:45,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=448, Invalid=2744, Unknown=0, NotChecked=0, Total=3192 [2024-10-24 01:50:45,535 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 1287 mSDsluCounter, 9445 mSDsCounter, 0 mSdLazyCounter, 6311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 9966 SdHoareTripleChecker+Invalid, 6312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:45,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 9966 Invalid, 6312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6311 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 01:50:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2024-10-24 01:50:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 2165. [2024-10-24 01:50:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2165 states, 2164 states have (on average 1.4288354898336415) internal successors, (3092), 2164 states have internal predecessors, (3092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3092 transitions. [2024-10-24 01:50:45,633 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 3092 transitions. Word has length 88 [2024-10-24 01:50:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:45,633 INFO L471 AbstractCegarLoop]: Abstraction has 2165 states and 3092 transitions. [2024-10-24 01:50:45,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3092 transitions. [2024-10-24 01:50:45,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 01:50:45,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:45,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:45,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 01:50:45,635 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:45,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:45,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1897441895, now seen corresponding path program 1 times [2024-10-24 01:50:45,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:45,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618569958] [2024-10-24 01:50:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:45,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:46,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:46,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618569958] [2024-10-24 01:50:46,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618569958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:46,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:46,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:50:46,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388050409] [2024-10-24 01:50:46,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:46,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:50:46,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:46,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:50:46,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:50:46,190 INFO L87 Difference]: Start difference. First operand 2165 states and 3092 transitions. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:46,548 INFO L93 Difference]: Finished difference Result 4895 states and 7039 transitions. [2024-10-24 01:50:46,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:50:46,549 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-24 01:50:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:46,552 INFO L225 Difference]: With dead ends: 4895 [2024-10-24 01:50:46,552 INFO L226 Difference]: Without dead ends: 4219 [2024-10-24 01:50:46,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-10-24 01:50:46,554 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 612 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:46,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1088 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4219 states. [2024-10-24 01:50:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4219 to 2154. [2024-10-24 01:50:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2153 states have (on average 1.4296330701346958) internal successors, (3078), 2153 states have internal predecessors, (3078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 3078 transitions. [2024-10-24 01:50:46,588 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 3078 transitions. Word has length 89 [2024-10-24 01:50:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:46,589 INFO L471 AbstractCegarLoop]: Abstraction has 2154 states and 3078 transitions. [2024-10-24 01:50:46,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3078 transitions. [2024-10-24 01:50:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 01:50:46,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:46,591 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:50:46,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 01:50:46,591 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:46,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:46,592 INFO L85 PathProgramCache]: Analyzing trace with hash -533982139, now seen corresponding path program 1 times [2024-10-24 01:50:46,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:46,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628659564] [2024-10-24 01:50:46,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:46,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:46,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:46,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628659564] [2024-10-24 01:50:46,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628659564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:46,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:46,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:50:46,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600417240] [2024-10-24 01:50:46,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:46,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:50:46,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:46,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:50:46,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:46,698 INFO L87 Difference]: Start difference. First operand 2154 states and 3078 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:46,723 INFO L93 Difference]: Finished difference Result 4471 states and 6423 transitions. [2024-10-24 01:50:46,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:50:46,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-10-24 01:50:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:46,726 INFO L225 Difference]: With dead ends: 4471 [2024-10-24 01:50:46,726 INFO L226 Difference]: Without dead ends: 3007 [2024-10-24 01:50:46,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:46,729 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 81 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:46,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 391 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-24 01:50:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2897. [2024-10-24 01:50:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2896 states have (on average 1.4271408839779005) internal successors, (4133), 2896 states have internal predecessors, (4133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 4133 transitions. [2024-10-24 01:50:46,761 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 4133 transitions. Word has length 117 [2024-10-24 01:50:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:46,761 INFO L471 AbstractCegarLoop]: Abstraction has 2897 states and 4133 transitions. [2024-10-24 01:50:46,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 4133 transitions. [2024-10-24 01:50:46,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 01:50:46,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:46,763 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:50:46,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 01:50:46,763 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:46,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:46,764 INFO L85 PathProgramCache]: Analyzing trace with hash -870729236, now seen corresponding path program 1 times [2024-10-24 01:50:46,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:46,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788712024] [2024-10-24 01:50:46,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:46,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:46,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:46,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788712024] [2024-10-24 01:50:46,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788712024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:46,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:46,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:50:46,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399101724] [2024-10-24 01:50:46,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:46,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:46,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:46,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:46,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:46,907 INFO L87 Difference]: Start difference. First operand 2897 states and 4133 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:47,126 INFO L93 Difference]: Finished difference Result 10571 states and 15263 transitions. [2024-10-24 01:50:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:50:47,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-10-24 01:50:47,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:47,131 INFO L225 Difference]: With dead ends: 10571 [2024-10-24 01:50:47,131 INFO L226 Difference]: Without dead ends: 7784 [2024-10-24 01:50:47,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:50:47,136 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 926 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:47,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 338 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7784 states. [2024-10-24 01:50:47,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7784 to 6182. [2024-10-24 01:50:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6182 states, 6181 states have (on average 1.4313217925901958) internal successors, (8847), 6181 states have internal predecessors, (8847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6182 states to 6182 states and 8847 transitions. [2024-10-24 01:50:47,196 INFO L78 Accepts]: Start accepts. Automaton has 6182 states and 8847 transitions. Word has length 119 [2024-10-24 01:50:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:47,196 INFO L471 AbstractCegarLoop]: Abstraction has 6182 states and 8847 transitions. [2024-10-24 01:50:47,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 6182 states and 8847 transitions. [2024-10-24 01:50:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 01:50:47,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:47,198 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:50:47,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-24 01:50:47,198 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:47,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:47,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1954144937, now seen corresponding path program 1 times [2024-10-24 01:50:47,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:47,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874774867] [2024-10-24 01:50:47,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:47,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:47,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:47,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874774867] [2024-10-24 01:50:47,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874774867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:47,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:47,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:50:47,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709267944] [2024-10-24 01:50:47,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:47,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:47,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:47,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:47,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:47,328 INFO L87 Difference]: Start difference. First operand 6182 states and 8847 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:47,576 INFO L93 Difference]: Finished difference Result 20526 states and 29505 transitions. [2024-10-24 01:50:47,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:50:47,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-10-24 01:50:47,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:47,594 INFO L225 Difference]: With dead ends: 20526 [2024-10-24 01:50:47,594 INFO L226 Difference]: Without dead ends: 14454 [2024-10-24 01:50:47,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:50:47,602 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 841 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:47,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 336 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14454 states. [2024-10-24 01:50:47,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14454 to 13252. [2024-10-24 01:50:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13252 states, 13251 states have (on average 1.4319673986868915) internal successors, (18975), 13251 states have internal predecessors, (18975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13252 states to 13252 states and 18975 transitions. [2024-10-24 01:50:47,762 INFO L78 Accepts]: Start accepts. Automaton has 13252 states and 18975 transitions. Word has length 119 [2024-10-24 01:50:47,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:47,762 INFO L471 AbstractCegarLoop]: Abstraction has 13252 states and 18975 transitions. [2024-10-24 01:50:47,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 13252 states and 18975 transitions. [2024-10-24 01:50:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 01:50:47,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:47,764 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:50:47,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 01:50:47,764 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:47,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:47,764 INFO L85 PathProgramCache]: Analyzing trace with hash -69998109, now seen corresponding path program 1 times [2024-10-24 01:50:47,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:47,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184624051] [2024-10-24 01:50:47,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:47,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:47,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:47,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184624051] [2024-10-24 01:50:47,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184624051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:47,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:47,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:50:47,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059929010] [2024-10-24 01:50:47,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:47,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:47,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:47,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:47,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:47,929 INFO L87 Difference]: Start difference. First operand 13252 states and 18975 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:48,203 INFO L93 Difference]: Finished difference Result 49536 states and 71489 transitions. [2024-10-24 01:50:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:50:48,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-10-24 01:50:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:48,251 INFO L225 Difference]: With dead ends: 49536 [2024-10-24 01:50:48,251 INFO L226 Difference]: Without dead ends: 36394 [2024-10-24 01:50:48,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:50:48,270 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 1011 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:48,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 340 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:48,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36394 states. [2024-10-24 01:50:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36394 to 28392. [2024-10-24 01:50:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28392 states, 28391 states have (on average 1.4311225388327287) internal successors, (40631), 28391 states have internal predecessors, (40631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:48,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28392 states to 28392 states and 40631 transitions. [2024-10-24 01:50:48,737 INFO L78 Accepts]: Start accepts. Automaton has 28392 states and 40631 transitions. Word has length 119 [2024-10-24 01:50:48,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:48,737 INFO L471 AbstractCegarLoop]: Abstraction has 28392 states and 40631 transitions. [2024-10-24 01:50:48,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 28392 states and 40631 transitions. [2024-10-24 01:50:48,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 01:50:48,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:48,739 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:50:48,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-24 01:50:48,740 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:48,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:48,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1895685353, now seen corresponding path program 1 times [2024-10-24 01:50:48,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:48,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503271254] [2024-10-24 01:50:48,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:48,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:48,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:48,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503271254] [2024-10-24 01:50:48,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503271254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:48,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:48,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:50:48,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582447983] [2024-10-24 01:50:48,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:48,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:48,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:48,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:48,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:48,900 INFO L87 Difference]: Start difference. First operand 28392 states and 40631 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:49,292 INFO L93 Difference]: Finished difference Result 64359 states and 92287 transitions. [2024-10-24 01:50:49,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:50:49,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-10-24 01:50:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:49,328 INFO L225 Difference]: With dead ends: 64359 [2024-10-24 01:50:49,329 INFO L226 Difference]: Without dead ends: 36077 [2024-10-24 01:50:49,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:50:49,355 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 895 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:49,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 388 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36077 states. [2024-10-24 01:50:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36077 to 30273. [2024-10-24 01:50:49,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30273 states, 30272 states have (on average 1.4250462473572938) internal successors, (43139), 30272 states have internal predecessors, (43139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30273 states to 30273 states and 43139 transitions. [2024-10-24 01:50:49,821 INFO L78 Accepts]: Start accepts. Automaton has 30273 states and 43139 transitions. Word has length 119 [2024-10-24 01:50:49,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:49,821 INFO L471 AbstractCegarLoop]: Abstraction has 30273 states and 43139 transitions. [2024-10-24 01:50:49,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:49,822 INFO L276 IsEmpty]: Start isEmpty. Operand 30273 states and 43139 transitions. [2024-10-24 01:50:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 01:50:49,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:49,830 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:49,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-24 01:50:49,830 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:49,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:49,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1459233051, now seen corresponding path program 1 times [2024-10-24 01:50:49,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:49,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249153236] [2024-10-24 01:50:49,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:49,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-24 01:50:50,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:50,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249153236] [2024-10-24 01:50:50,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249153236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:50,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:50,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:50:50,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353871918] [2024-10-24 01:50:50,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:50,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:50:50,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:50,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:50:50,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:50,138 INFO L87 Difference]: Start difference. First operand 30273 states and 43139 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:50,278 INFO L93 Difference]: Finished difference Result 58317 states and 82933 transitions. [2024-10-24 01:50:50,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:50:50,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 146 [2024-10-24 01:50:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:50,315 INFO L225 Difference]: With dead ends: 58317 [2024-10-24 01:50:50,315 INFO L226 Difference]: Without dead ends: 28160 [2024-10-24 01:50:50,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:50,342 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 74 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:50,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 380 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28160 states. [2024-10-24 01:50:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28160 to 27528. [2024-10-24 01:50:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27528 states, 27527 states have (on average 1.4123951029897919) internal successors, (38879), 27527 states have internal predecessors, (38879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27528 states to 27528 states and 38879 transitions. [2024-10-24 01:50:50,842 INFO L78 Accepts]: Start accepts. Automaton has 27528 states and 38879 transitions. Word has length 146 [2024-10-24 01:50:50,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:50,842 INFO L471 AbstractCegarLoop]: Abstraction has 27528 states and 38879 transitions. [2024-10-24 01:50:50,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 27528 states and 38879 transitions. [2024-10-24 01:50:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 01:50:50,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:50,848 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:50,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-24 01:50:50,848 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:50,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:50,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1183805486, now seen corresponding path program 1 times [2024-10-24 01:50:50,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:50,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709325850] [2024-10-24 01:50:50,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:50,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-24 01:50:51,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:51,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709325850] [2024-10-24 01:50:51,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709325850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:51,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:51,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:50:51,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430132852] [2024-10-24 01:50:51,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:51,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:50:51,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:51,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:50:51,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:51,119 INFO L87 Difference]: Start difference. First operand 27528 states and 38879 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:51,243 INFO L93 Difference]: Finished difference Result 52848 states and 74441 transitions. [2024-10-24 01:50:51,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:50:51,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 147 [2024-10-24 01:50:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:51,270 INFO L225 Difference]: With dead ends: 52848 [2024-10-24 01:50:51,270 INFO L226 Difference]: Without dead ends: 25430 [2024-10-24 01:50:51,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:51,296 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 68 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:51,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:51,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25430 states. [2024-10-24 01:50:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25430 to 24828. [2024-10-24 01:50:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24828 states, 24827 states have (on average 1.3968260361702984) internal successors, (34679), 24827 states have internal predecessors, (34679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24828 states to 24828 states and 34679 transitions. [2024-10-24 01:50:51,647 INFO L78 Accepts]: Start accepts. Automaton has 24828 states and 34679 transitions. Word has length 147 [2024-10-24 01:50:51,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:51,647 INFO L471 AbstractCegarLoop]: Abstraction has 24828 states and 34679 transitions. [2024-10-24 01:50:51,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 24828 states and 34679 transitions. [2024-10-24 01:50:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 01:50:51,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:51,652 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:51,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-24 01:50:51,652 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:51,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1381702518, now seen corresponding path program 1 times [2024-10-24 01:50:51,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:51,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852768940] [2024-10-24 01:50:51,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:51,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-24 01:50:51,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:51,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852768940] [2024-10-24 01:50:51,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852768940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:51,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:51,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:50:51,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991304457] [2024-10-24 01:50:51,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:51,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:50:51,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:51,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:50:51,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:51,790 INFO L87 Difference]: Start difference. First operand 24828 states and 34679 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:52,013 INFO L93 Difference]: Finished difference Result 47448 states and 66041 transitions. [2024-10-24 01:50:52,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:50:52,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 148 [2024-10-24 01:50:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:52,030 INFO L225 Difference]: With dead ends: 47448 [2024-10-24 01:50:52,031 INFO L226 Difference]: Without dead ends: 22730 [2024-10-24 01:50:52,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:52,039 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 61 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:52,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 382 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:52,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22730 states. [2024-10-24 01:50:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22730 to 22128. [2024-10-24 01:50:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22128 states, 22127 states have (on average 1.3774574049803407) internal successors, (30479), 22127 states have internal predecessors, (30479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22128 states to 22128 states and 30479 transitions. [2024-10-24 01:50:52,329 INFO L78 Accepts]: Start accepts. Automaton has 22128 states and 30479 transitions. Word has length 148 [2024-10-24 01:50:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:52,331 INFO L471 AbstractCegarLoop]: Abstraction has 22128 states and 30479 transitions. [2024-10-24 01:50:52,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 22128 states and 30479 transitions. [2024-10-24 01:50:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-24 01:50:52,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:52,342 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-24 01:50:52,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-24 01:50:52,342 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:52,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:52,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1342377023, now seen corresponding path program 1 times [2024-10-24 01:50:52,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:52,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76433868] [2024-10-24 01:50:52,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:52,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:52,481 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:50:52,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:52,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76433868] [2024-10-24 01:50:52,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76433868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:52,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:52,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:50:52,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531672711] [2024-10-24 01:50:52,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:52,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:50:52,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:52,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:50:52,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:52,484 INFO L87 Difference]: Start difference. First operand 22128 states and 30479 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:52,634 INFO L93 Difference]: Finished difference Result 63964 states and 87601 transitions. [2024-10-24 01:50:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:50:52,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 149 [2024-10-24 01:50:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:52,690 INFO L225 Difference]: With dead ends: 63964 [2024-10-24 01:50:52,690 INFO L226 Difference]: Without dead ends: 41946 [2024-10-24 01:50:52,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:52,715 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 54 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:52,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 383 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41946 states. [2024-10-24 01:50:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41946 to 39144. [2024-10-24 01:50:53,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39144 states, 39143 states have (on average 1.3601154740311168) internal successors, (53239), 39143 states have internal predecessors, (53239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39144 states to 39144 states and 53239 transitions. [2024-10-24 01:50:53,378 INFO L78 Accepts]: Start accepts. Automaton has 39144 states and 53239 transitions. Word has length 149 [2024-10-24 01:50:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:53,379 INFO L471 AbstractCegarLoop]: Abstraction has 39144 states and 53239 transitions. [2024-10-24 01:50:53,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 39144 states and 53239 transitions. [2024-10-24 01:50:53,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:50:53,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:53,383 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:53,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-24 01:50:53,383 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:50:53,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1950723015, now seen corresponding path program 1 times [2024-10-24 01:50:53,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:53,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667308992] [2024-10-24 01:50:53,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:53,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:53,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:53,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667308992] [2024-10-24 01:50:53,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667308992] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:50:53,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191076943] [2024-10-24 01:50:53,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:53,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:50:53,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:50:53,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:50:53,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 01:50:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:54,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 01:50:54,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:50:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:55,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:50:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:56,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191076943] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:50:56,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:50:56,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-10-24 01:50:56,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025359523] [2024-10-24 01:50:56,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:50:56,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 01:50:56,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:56,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 01:50:56,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2024-10-24 01:50:56,296 INFO L87 Difference]: Start difference. First operand 39144 states and 53239 transitions. Second operand has 25 states, 25 states have (on average 16.88) internal successors, (422), 24 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:04,424 INFO L93 Difference]: Finished difference Result 475754 states and 646001 transitions. [2024-10-24 01:51:04,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2024-10-24 01:51:04,424 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 16.88) internal successors, (422), 24 states have internal predecessors, (422), 0 states have call successors, (0), 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 150 [2024-10-24 01:51:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:05,793 INFO L225 Difference]: With dead ends: 475754 [2024-10-24 01:51:05,797 INFO L226 Difference]: Without dead ends: 436720 [2024-10-24 01:51:05,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16017 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=4981, Invalid=37661, Unknown=0, NotChecked=0, Total=42642 [2024-10-24 01:51:05,950 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 4477 mSDsluCounter, 2805 mSDsCounter, 0 mSdLazyCounter, 3798 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4477 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 3819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:05,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4477 Valid, 3058 Invalid, 3819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3798 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 01:51:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436720 states. [2024-10-24 01:51:10,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436720 to 230389. [2024-10-24 01:51:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230389 states, 230388 states have (on average 1.3512292306890983) internal successors, (311307), 230388 states have internal predecessors, (311307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230389 states to 230389 states and 311307 transitions. [2024-10-24 01:51:10,894 INFO L78 Accepts]: Start accepts. Automaton has 230389 states and 311307 transitions. Word has length 150 [2024-10-24 01:51:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:10,894 INFO L471 AbstractCegarLoop]: Abstraction has 230389 states and 311307 transitions. [2024-10-24 01:51:10,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 16.88) internal successors, (422), 24 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 230389 states and 311307 transitions. [2024-10-24 01:51:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:51:10,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:10,910 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:51:10,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 01:51:11,110 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,SelfDestructingSolverStorable37 [2024-10-24 01:51:11,111 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:51:11,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:11,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2086734025, now seen corresponding path program 1 times [2024-10-24 01:51:11,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:11,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664652278] [2024-10-24 01:51:11,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:11,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:51:12,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:12,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664652278] [2024-10-24 01:51:12,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664652278] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:51:12,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077596326] [2024-10-24 01:51:12,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:12,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:51:12,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:51:12,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:51:12,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 01:51:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:12,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-24 01:51:12,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:51:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:51:12,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:51:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:51:14,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077596326] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:51:14,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:51:14,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 25 [2024-10-24 01:51:14,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731054340] [2024-10-24 01:51:14,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:51:14,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 01:51:14,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:14,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 01:51:14,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-10-24 01:51:14,156 INFO L87 Difference]: Start difference. First operand 230389 states and 311307 transitions. Second operand has 25 states, 25 states have (on average 17.0) internal successors, (425), 25 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)