./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label05.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 22537e02f4cb8698af716d464e1d3c3736fc7fa276fb73e44b45e0b685f49af8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:54:23,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:54:23,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:54:23,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:54:23,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:54:23,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:54:23,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:54:23,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:54:23,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:54:23,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:54:23,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:54:23,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:54:23,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:54:23,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:54:23,866 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:54:23,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:54:23,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:54:23,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:54:23,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:54:23,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:54:23,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:54:23,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:54:23,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:54:23,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:54:23,873 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:54:23,873 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:54:23,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:54:23,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:54:23,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:54:23,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:54:23,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:54:23,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:54:23,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:54:23,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:54:23,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:54:23,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:54:23,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:54:23,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:54:23,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:54:23,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:54:23,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:54:23,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:54:23,878 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 -> 22537e02f4cb8698af716d464e1d3c3736fc7fa276fb73e44b45e0b685f49af8 [2024-11-10 00:54:24,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:54:24,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:54:24,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:54:24,170 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:54:24,170 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:54:24,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label05.c [2024-11-10 00:54:25,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:54:26,141 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:54:26,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label05.c [2024-11-10 00:54:26,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7df20f2d/4b229cc0d4674498b7246359135a9a87/FLAGbea09670f [2024-11-10 00:54:26,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7df20f2d/4b229cc0d4674498b7246359135a9a87 [2024-11-10 00:54:26,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:54:26,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:54:26,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:54:26,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:54:26,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:54:26,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:54:26" (1/1) ... [2024-11-10 00:54:26,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e61cba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:26, skipping insertion in model container [2024-11-10 00:54:26,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:54:26" (1/1) ... [2024-11-10 00:54:26,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:54:26,761 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label05.c[11640,11653] [2024-11-10 00:54:26,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label05.c[18576,18589] [2024-11-10 00:54:27,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:54:27,444 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:54:27,479 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label05.c[11640,11653] [2024-11-10 00:54:27,494 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label05.c[18576,18589] [2024-11-10 00:54:27,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:54:27,874 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:54:27,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:27 WrapperNode [2024-11-10 00:54:27,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:54:27,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:54:27,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:54:27,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:54:27,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:27" (1/1) ... [2024-11-10 00:54:27,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:27" (1/1) ... [2024-11-10 00:54:28,322 INFO L138 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5097 [2024-11-10 00:54:28,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:54:28,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:54:28,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:54:28,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:54:28,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:27" (1/1) ... [2024-11-10 00:54:28,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:27" (1/1) ... [2024-11-10 00:54:28,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:27" (1/1) ... [2024-11-10 00:54:28,562 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:54:28,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:27" (1/1) ... [2024-11-10 00:54:28,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:27" (1/1) ... [2024-11-10 00:54:28,697 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:27" (1/1) ... [2024-11-10 00:54:28,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:27" (1/1) ... [2024-11-10 00:54:28,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:27" (1/1) ... [2024-11-10 00:54:28,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:27" (1/1) ... [2024-11-10 00:54:28,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:54:28,861 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:54:28,861 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:54:28,861 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:54:28,862 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:27" (1/1) ... [2024-11-10 00:54:28,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:54:28,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:54:28,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:54:28,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:54:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:54:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:54:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:54:28,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:54:29,040 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:54:29,043 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:54:34,577 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2127: havoc calculate_output_#t~ret38#1; [2024-11-10 00:54:34,577 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3606: havoc calculate_output2_#t~ret39#1; [2024-11-10 00:54:34,577 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5096: havoc calculate_output3_#t~ret40#1; [2024-11-10 00:54:34,914 INFO L? ?]: Removed 2081 outVars from TransFormulas that were not future-live. [2024-11-10 00:54:34,914 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:54:34,960 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:54:34,961 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:54:34,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:54:34 BoogieIcfgContainer [2024-11-10 00:54:34,961 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:54:34,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:54:34,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:54:34,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:54:34,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:54:26" (1/3) ... [2024-11-10 00:54:34,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41784d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:54:34, skipping insertion in model container [2024-11-10 00:54:34,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:27" (2/3) ... [2024-11-10 00:54:34,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41784d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:54:34, skipping insertion in model container [2024-11-10 00:54:34,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:54:34" (3/3) ... [2024-11-10 00:54:34,973 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label05.c [2024-11-10 00:54:34,990 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:54:34,990 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:54:35,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:54:35,090 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;@6dcc716d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:54:35,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:54:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 906 states, 903 states have (on average 2.6511627906976742) internal successors, (2394), 905 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:35,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:54:35,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:35,108 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] [2024-11-10 00:54:35,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:35,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:35,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1826649402, now seen corresponding path program 1 times [2024-11-10 00:54:35,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:35,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882839014] [2024-11-10 00:54:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:35,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:35,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:35,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882839014] [2024-11-10 00:54:35,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882839014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:35,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:35,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:54:35,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556731215] [2024-11-10 00:54:35,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:35,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:54:35,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:35,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:54:35,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:54:35,549 INFO L87 Difference]: Start difference. First operand has 906 states, 903 states have (on average 2.6511627906976742) internal successors, (2394), 905 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:35,639 INFO L93 Difference]: Finished difference Result 1773 states and 4716 transitions. [2024-11-10 00:54:35,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:54:35,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-10 00:54:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:35,668 INFO L225 Difference]: With dead ends: 1773 [2024-11-10 00:54:35,668 INFO L226 Difference]: Without dead ends: 838 [2024-11-10 00:54:35,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:54:35,681 INFO L432 NwaCegarLoop]: 2326 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:35,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:35,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-10 00:54:35,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-10 00:54:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 2.702153110047847) internal successors, (2259), 837 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:35,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2259 transitions. [2024-11-10 00:54:35,763 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2259 transitions. Word has length 26 [2024-11-10 00:54:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:35,764 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 2259 transitions. [2024-11-10 00:54:35,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2259 transitions. [2024-11-10 00:54:35,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:54:35,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:35,766 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] [2024-11-10 00:54:35,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:54:35,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:35,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:35,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1417825177, now seen corresponding path program 1 times [2024-11-10 00:54:35,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:35,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757170831] [2024-11-10 00:54:35,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:35,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:36,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:36,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757170831] [2024-11-10 00:54:36,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757170831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:36,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:36,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:54:36,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453870368] [2024-11-10 00:54:36,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:36,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:54:36,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:36,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:54:36,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:54:36,037 INFO L87 Difference]: Start difference. First operand 838 states and 2259 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:36,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:36,190 INFO L93 Difference]: Finished difference Result 887 states and 2333 transitions. [2024-11-10 00:54:36,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:54:36,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-10 00:54:36,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:36,196 INFO L225 Difference]: With dead ends: 887 [2024-11-10 00:54:36,196 INFO L226 Difference]: Without dead ends: 838 [2024-11-10 00:54:36,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:54:36,198 INFO L432 NwaCegarLoop]: 2257 mSDtfsCounter, 0 mSDsluCounter, 6735 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8992 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:36,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8992 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:54:36,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-10 00:54:36,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-10 00:54:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 2.665071770334928) internal successors, (2228), 837 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2228 transitions. [2024-11-10 00:54:36,236 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2228 transitions. Word has length 26 [2024-11-10 00:54:36,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:36,237 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 2228 transitions. [2024-11-10 00:54:36,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:36,238 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2228 transitions. [2024-11-10 00:54:36,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 00:54:36,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:36,241 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] [2024-11-10 00:54:36,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:54:36,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:36,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:36,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2138475845, now seen corresponding path program 1 times [2024-11-10 00:54:36,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:36,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116397881] [2024-11-10 00:54:36,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:36,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:36,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:36,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116397881] [2024-11-10 00:54:36,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116397881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:36,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:36,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:54:36,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715470595] [2024-11-10 00:54:36,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:36,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:54:36,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:36,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:54:36,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:54:36,466 INFO L87 Difference]: Start difference. First operand 838 states and 2228 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:36,772 INFO L93 Difference]: Finished difference Result 1288 states and 2928 transitions. [2024-11-10 00:54:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:54:36,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-10 00:54:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:36,779 INFO L225 Difference]: With dead ends: 1288 [2024-11-10 00:54:36,779 INFO L226 Difference]: Without dead ends: 1243 [2024-11-10 00:54:36,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 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-11-10 00:54:36,781 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 11386 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11386 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:36,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11386 Valid, 3378 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:54:36,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2024-11-10 00:54:36,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 880. [2024-11-10 00:54:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 2.612756264236902) internal successors, (2294), 879 states have internal predecessors, (2294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2294 transitions. [2024-11-10 00:54:36,807 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2294 transitions. Word has length 56 [2024-11-10 00:54:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:36,807 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 2294 transitions. [2024-11-10 00:54:36,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2294 transitions. [2024-11-10 00:54:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:54:36,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:36,810 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] [2024-11-10 00:54:36,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:54:36,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:36,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:36,811 INFO L85 PathProgramCache]: Analyzing trace with hash 208440989, now seen corresponding path program 1 times [2024-11-10 00:54:36,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:36,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9428112] [2024-11-10 00:54:36,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:36,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:37,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:37,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9428112] [2024-11-10 00:54:37,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9428112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:37,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:37,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:54:37,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286534737] [2024-11-10 00:54:37,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:37,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:54:37,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:37,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:54:37,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:54:37,114 INFO L87 Difference]: Start difference. First operand 880 states and 2294 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:37,328 INFO L93 Difference]: Finished difference Result 970 states and 2432 transitions. [2024-11-10 00:54:37,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:54:37,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-10 00:54:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:37,334 INFO L225 Difference]: With dead ends: 970 [2024-11-10 00:54:37,335 INFO L226 Difference]: Without dead ends: 883 [2024-11-10 00:54:37,338 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-11-10 00:54:37,340 INFO L432 NwaCegarLoop]: 2221 mSDtfsCounter, 4362 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4362 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:37,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4362 Valid, 2486 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:54:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-10 00:54:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 880. [2024-11-10 00:54:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 2.611617312072893) internal successors, (2293), 879 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-11-10 00:54:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2293 transitions. [2024-11-10 00:54:37,370 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2293 transitions. Word has length 58 [2024-11-10 00:54:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:37,372 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 2293 transitions. [2024-11-10 00:54:37,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2293 transitions. [2024-11-10 00:54:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 00:54:37,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:37,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] [2024-11-10 00:54:37,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:54:37,376 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:37,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:37,377 INFO L85 PathProgramCache]: Analyzing trace with hash -404444728, now seen corresponding path program 1 times [2024-11-10 00:54:37,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:37,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659756497] [2024-11-10 00:54:37,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:37,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:37,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:37,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659756497] [2024-11-10 00:54:37,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659756497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:37,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:37,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:37,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695180574] [2024-11-10 00:54:37,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:37,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:37,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:37,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:37,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:37,463 INFO L87 Difference]: Start difference. First operand 880 states and 2293 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:37,502 INFO L93 Difference]: Finished difference Result 1042 states and 2543 transitions. [2024-11-10 00:54:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:37,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-10 00:54:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:37,508 INFO L225 Difference]: With dead ends: 1042 [2024-11-10 00:54:37,509 INFO L226 Difference]: Without dead ends: 955 [2024-11-10 00:54:37,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:37,511 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 2166 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:37,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 2290 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-10 00:54:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 952. [2024-11-10 00:54:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 950 states have (on average 2.5294736842105263) internal successors, (2403), 951 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2403 transitions. [2024-11-10 00:54:37,542 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2403 transitions. Word has length 59 [2024-11-10 00:54:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:37,542 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 2403 transitions. [2024-11-10 00:54:37,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2403 transitions. [2024-11-10 00:54:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:54:37,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:37,544 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] [2024-11-10 00:54:37,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:54:37,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:37,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:37,545 INFO L85 PathProgramCache]: Analyzing trace with hash 788028767, now seen corresponding path program 1 times [2024-11-10 00:54:37,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:37,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132138899] [2024-11-10 00:54:37,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:37,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:37,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:37,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:37,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132138899] [2024-11-10 00:54:37,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132138899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:37,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:37,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:37,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784450957] [2024-11-10 00:54:37,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:37,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:37,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:37,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:37,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:37,705 INFO L87 Difference]: Start difference. First operand 952 states and 2403 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:37,741 INFO L93 Difference]: Finished difference Result 1254 states and 2865 transitions. [2024-11-10 00:54:37,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:37,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:54:37,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:37,747 INFO L225 Difference]: With dead ends: 1254 [2024-11-10 00:54:37,747 INFO L226 Difference]: Without dead ends: 1095 [2024-11-10 00:54:37,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:37,750 INFO L432 NwaCegarLoop]: 2276 mSDtfsCounter, 2178 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2178 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:37,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2178 Valid, 2351 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2024-11-10 00:54:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1092. [2024-11-10 00:54:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1090 states have (on average 2.398165137614679) internal successors, (2614), 1091 states have internal predecessors, (2614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 2614 transitions. [2024-11-10 00:54:37,781 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 2614 transitions. Word has length 60 [2024-11-10 00:54:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:37,781 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 2614 transitions. [2024-11-10 00:54:37,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 2614 transitions. [2024-11-10 00:54:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:54:37,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:37,783 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] [2024-11-10 00:54:37,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:54:37,783 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:37,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:37,784 INFO L85 PathProgramCache]: Analyzing trace with hash -213380961, now seen corresponding path program 1 times [2024-11-10 00:54:37,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:37,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510544626] [2024-11-10 00:54:37,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:37,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:37,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:37,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510544626] [2024-11-10 00:54:37,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510544626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:37,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:37,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:37,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339852560] [2024-11-10 00:54:37,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:37,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:37,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:37,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:37,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:37,845 INFO L87 Difference]: Start difference. First operand 1092 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:37,880 INFO L93 Difference]: Finished difference Result 1658 states and 3470 transitions. [2024-11-10 00:54:37,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:37,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:54:37,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:37,887 INFO L225 Difference]: With dead ends: 1658 [2024-11-10 00:54:37,887 INFO L226 Difference]: Without dead ends: 1359 [2024-11-10 00:54:37,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:37,889 INFO L432 NwaCegarLoop]: 2274 mSDtfsCounter, 2176 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:37,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 2353 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2024-11-10 00:54:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1356. [2024-11-10 00:54:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1354 states have (on average 2.218611521418021) internal successors, (3004), 1355 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3004 transitions. [2024-11-10 00:54:37,922 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3004 transitions. Word has length 60 [2024-11-10 00:54:37,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:37,923 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 3004 transitions. [2024-11-10 00:54:37,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:37,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3004 transitions. [2024-11-10 00:54:37,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:54:37,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:37,924 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] [2024-11-10 00:54:37,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:54:37,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:37,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:37,925 INFO L85 PathProgramCache]: Analyzing trace with hash -227830817, now seen corresponding path program 1 times [2024-11-10 00:54:37,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:37,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027040217] [2024-11-10 00:54:37,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:37,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:37,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:37,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027040217] [2024-11-10 00:54:37,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027040217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:37,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:37,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:37,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113263958] [2024-11-10 00:54:37,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:37,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:37,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:37,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:37,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:37,992 INFO L87 Difference]: Start difference. First operand 1356 states and 3004 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:38,033 INFO L93 Difference]: Finished difference Result 2418 states and 4584 transitions. [2024-11-10 00:54:38,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:38,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:54:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:38,042 INFO L225 Difference]: With dead ends: 2418 [2024-11-10 00:54:38,042 INFO L226 Difference]: Without dead ends: 1855 [2024-11-10 00:54:38,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:38,045 INFO L432 NwaCegarLoop]: 2272 mSDtfsCounter, 2174 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:38,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 2355 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2024-11-10 00:54:38,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1852. [2024-11-10 00:54:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1850 states have (on average 2.0108108108108107) internal successors, (3720), 1851 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 3720 transitions. [2024-11-10 00:54:38,094 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 3720 transitions. Word has length 60 [2024-11-10 00:54:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:38,095 INFO L471 AbstractCegarLoop]: Abstraction has 1852 states and 3720 transitions. [2024-11-10 00:54:38,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 3720 transitions. [2024-11-10 00:54:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:54:38,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:38,096 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] [2024-11-10 00:54:38,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:54:38,096 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:38,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:38,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1863771935, now seen corresponding path program 1 times [2024-11-10 00:54:38,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:38,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424865244] [2024-11-10 00:54:38,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:38,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:38,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:38,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424865244] [2024-11-10 00:54:38,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424865244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:38,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:38,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:38,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275064566] [2024-11-10 00:54:38,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:38,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:38,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:38,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:38,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:38,155 INFO L87 Difference]: Start difference. First operand 1852 states and 3720 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:38,208 INFO L93 Difference]: Finished difference Result 3842 states and 6620 transitions. [2024-11-10 00:54:38,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:38,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:54:38,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:38,219 INFO L225 Difference]: With dead ends: 3842 [2024-11-10 00:54:38,219 INFO L226 Difference]: Without dead ends: 2783 [2024-11-10 00:54:38,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:38,222 INFO L432 NwaCegarLoop]: 2270 mSDtfsCounter, 2172 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:38,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 2357 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2024-11-10 00:54:38,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2780. [2024-11-10 00:54:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2780 states, 2778 states have (on average 1.80849532037437) internal successors, (5024), 2779 states have internal predecessors, (5024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 5024 transitions. [2024-11-10 00:54:38,292 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 5024 transitions. Word has length 60 [2024-11-10 00:54:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:38,292 INFO L471 AbstractCegarLoop]: Abstraction has 2780 states and 5024 transitions. [2024-11-10 00:54:38,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:38,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 5024 transitions. [2024-11-10 00:54:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:54:38,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:38,293 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] [2024-11-10 00:54:38,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:54:38,294 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:38,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:38,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1339494880, now seen corresponding path program 1 times [2024-11-10 00:54:38,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:38,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349597233] [2024-11-10 00:54:38,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:38,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:38,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:38,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349597233] [2024-11-10 00:54:38,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349597233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:38,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:38,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:54:38,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826803604] [2024-11-10 00:54:38,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:38,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:54:38,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:54:38,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:54:38,519 INFO L87 Difference]: Start difference. First operand 2780 states and 5024 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:38,622 INFO L93 Difference]: Finished difference Result 2879 states and 5154 transitions. [2024-11-10 00:54:38,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:54:38,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:54:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:38,632 INFO L225 Difference]: With dead ends: 2879 [2024-11-10 00:54:38,633 INFO L226 Difference]: Without dead ends: 2876 [2024-11-10 00:54:38,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:54:38,634 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 0 mSDsluCounter, 13319 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15541 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:38,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15541 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:38,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2024-11-10 00:54:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2876. [2024-11-10 00:54:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2874 states have (on average 1.7759220598469032) internal successors, (5104), 2875 states have internal predecessors, (5104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 5104 transitions. [2024-11-10 00:54:38,703 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 5104 transitions. Word has length 60 [2024-11-10 00:54:38,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:38,703 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 5104 transitions. [2024-11-10 00:54:38,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 5104 transitions. [2024-11-10 00:54:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:54:38,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:38,705 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] [2024-11-10 00:54:38,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:54:38,705 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:38,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1070103071, now seen corresponding path program 1 times [2024-11-10 00:54:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:38,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064783458] [2024-11-10 00:54:38,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:38,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:38,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:38,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064783458] [2024-11-10 00:54:38,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064783458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:38,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:38,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:38,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680673730] [2024-11-10 00:54:38,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:38,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:38,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:38,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:38,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:38,767 INFO L87 Difference]: Start difference. First operand 2876 states and 5104 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:38,834 INFO L93 Difference]: Finished difference Result 5125 states and 8312 transitions. [2024-11-10 00:54:38,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:38,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:54:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:38,851 INFO L225 Difference]: With dead ends: 5125 [2024-11-10 00:54:38,851 INFO L226 Difference]: Without dead ends: 3938 [2024-11-10 00:54:38,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:38,856 INFO L432 NwaCegarLoop]: 2282 mSDtfsCounter, 2180 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:38,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2353 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:38,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2024-11-10 00:54:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3935. [2024-11-10 00:54:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3933 states have (on average 1.6687007373506229) internal successors, (6563), 3934 states have internal predecessors, (6563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 6563 transitions. [2024-11-10 00:54:38,960 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 6563 transitions. Word has length 60 [2024-11-10 00:54:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:38,960 INFO L471 AbstractCegarLoop]: Abstraction has 3935 states and 6563 transitions. [2024-11-10 00:54:38,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 6563 transitions. [2024-11-10 00:54:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:54:38,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:38,961 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] [2024-11-10 00:54:38,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:54:38,961 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:38,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:38,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1775454201, now seen corresponding path program 1 times [2024-11-10 00:54:38,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:38,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501269893] [2024-11-10 00:54:38,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:38,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:39,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:39,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501269893] [2024-11-10 00:54:39,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501269893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:39,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:39,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:39,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003909654] [2024-11-10 00:54:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:39,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:54:39,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:39,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:54:39,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:54:39,100 INFO L87 Difference]: Start difference. First operand 3935 states and 6563 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:47,110 INFO L93 Difference]: Finished difference Result 6194 states and 12916 transitions. [2024-11-10 00:54:47,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:54:47,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-10 00:54:47,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:47,133 INFO L225 Difference]: With dead ends: 6194 [2024-11-10 00:54:47,133 INFO L226 Difference]: Without dead ends: 5439 [2024-11-10 00:54:47,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:54:47,137 INFO L432 NwaCegarLoop]: 802 mSDtfsCounter, 4437 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8238 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 9338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 8238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:47,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4437 Valid, 825 Invalid, 9338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 8238 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-11-10 00:54:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5439 states. [2024-11-10 00:54:47,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5439 to 5439. [2024-11-10 00:54:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 5437 states have (on average 1.8486297590583043) internal successors, (10051), 5438 states have internal predecessors, (10051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:47,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 10051 transitions. [2024-11-10 00:54:47,306 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 10051 transitions. Word has length 62 [2024-11-10 00:54:47,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:47,307 INFO L471 AbstractCegarLoop]: Abstraction has 5439 states and 10051 transitions. [2024-11-10 00:54:47,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:47,307 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 10051 transitions. [2024-11-10 00:54:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:54:47,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:47,310 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:54:47,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:54:47,311 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:47,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:47,311 INFO L85 PathProgramCache]: Analyzing trace with hash 958545093, now seen corresponding path program 1 times [2024-11-10 00:54:47,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:47,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474672469] [2024-11-10 00:54:47,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:47,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:54:47,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:47,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474672469] [2024-11-10 00:54:47,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474672469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:47,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:47,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:54:47,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398726184] [2024-11-10 00:54:47,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:47,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:54:47,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:47,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:54:47,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:54:47,530 INFO L87 Difference]: Start difference. First operand 5439 states and 10051 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-11-10 00:54:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:48,080 INFO L93 Difference]: Finished difference Result 21825 states and 32975 transitions. [2024-11-10 00:54:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:54:48,081 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 81 [2024-11-10 00:54:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:48,120 INFO L225 Difference]: With dead ends: 21825 [2024-11-10 00:54:48,120 INFO L226 Difference]: Without dead ends: 18686 [2024-11-10 00:54:48,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:54:48,129 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 9054 mSDsluCounter, 2731 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9054 SdHoareTripleChecker+Valid, 5024 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:48,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9054 Valid, 5024 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:54:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18686 states. [2024-11-10 00:54:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18686 to 8575. [2024-11-10 00:54:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8575 states, 8573 states have (on average 1.6800419923014114) internal successors, (14403), 8574 states have internal predecessors, (14403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8575 states to 8575 states and 14403 transitions. [2024-11-10 00:54:48,408 INFO L78 Accepts]: Start accepts. Automaton has 8575 states and 14403 transitions. Word has length 81 [2024-11-10 00:54:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:48,408 INFO L471 AbstractCegarLoop]: Abstraction has 8575 states and 14403 transitions. [2024-11-10 00:54:48,409 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-11-10 00:54:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 8575 states and 14403 transitions. [2024-11-10 00:54:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:54:48,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:48,412 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:54:48,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:54:48,412 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:48,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash -42864635, now seen corresponding path program 1 times [2024-11-10 00:54:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:48,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105977218] [2024-11-10 00:54:48,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:48,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:54:48,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:48,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105977218] [2024-11-10 00:54:48,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105977218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:48,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:48,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:54:48,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592732075] [2024-11-10 00:54:48,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:48,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:54:48,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:48,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:54:48,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:54:48,582 INFO L87 Difference]: Start difference. First operand 8575 states and 14403 transitions. 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-11-10 00:54:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:49,044 INFO L93 Difference]: Finished difference Result 24961 states and 37327 transitions. [2024-11-10 00:54:49,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:54:49,045 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 81 [2024-11-10 00:54:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:49,088 INFO L225 Difference]: With dead ends: 24961 [2024-11-10 00:54:49,089 INFO L226 Difference]: Without dead ends: 21822 [2024-11-10 00:54:49,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:54:49,101 INFO L432 NwaCegarLoop]: 2290 mSDtfsCounter, 9078 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9078 SdHoareTripleChecker+Valid, 4956 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:49,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9078 Valid, 4956 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:54:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21822 states. [2024-11-10 00:54:49,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21822 to 13295. [2024-11-10 00:54:49,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13295 states, 13293 states have (on average 1.5721808470623637) internal successors, (20899), 13294 states have internal predecessors, (20899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13295 states to 13295 states and 20899 transitions. [2024-11-10 00:54:49,613 INFO L78 Accepts]: Start accepts. Automaton has 13295 states and 20899 transitions. Word has length 81 [2024-11-10 00:54:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:49,614 INFO L471 AbstractCegarLoop]: Abstraction has 13295 states and 20899 transitions. [2024-11-10 00:54:49,614 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-11-10 00:54:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 13295 states and 20899 transitions. [2024-11-10 00:54:49,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:54:49,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:49,617 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:54:49,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:54:49,618 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:49,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:49,618 INFO L85 PathProgramCache]: Analyzing trace with hash -57314491, now seen corresponding path program 1 times [2024-11-10 00:54:49,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:49,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987611391] [2024-11-10 00:54:49,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:49,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:54:49,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:49,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987611391] [2024-11-10 00:54:49,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987611391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:49,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:49,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:54:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094536756] [2024-11-10 00:54:49,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:49,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:54:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:49,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:54:49,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:54:49,820 INFO L87 Difference]: Start difference. First operand 13295 states and 20899 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:50,469 INFO L93 Difference]: Finished difference Result 28097 states and 41679 transitions. [2024-11-10 00:54:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:54:50,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 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-11-10 00:54:50,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:50,518 INFO L225 Difference]: With dead ends: 28097 [2024-11-10 00:54:50,519 INFO L226 Difference]: Without dead ends: 24958 [2024-11-10 00:54:50,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:54:50,530 INFO L432 NwaCegarLoop]: 2287 mSDtfsCounter, 9123 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9123 SdHoareTripleChecker+Valid, 4930 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:50,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9123 Valid, 4930 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:54:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24958 states. [2024-11-10 00:54:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24958 to 16431. [2024-11-10 00:54:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16431 states, 16429 states have (on average 1.536977296244446) internal successors, (25251), 16430 states have internal predecessors, (25251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16431 states to 16431 states and 25251 transitions. [2024-11-10 00:54:50,926 INFO L78 Accepts]: Start accepts. Automaton has 16431 states and 25251 transitions. Word has length 81 [2024-11-10 00:54:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:50,926 INFO L471 AbstractCegarLoop]: Abstraction has 16431 states and 25251 transitions. [2024-11-10 00:54:50,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 16431 states and 25251 transitions. [2024-11-10 00:54:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:54:50,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:50,929 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:54:50,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:54:50,930 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:50,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2034288261, now seen corresponding path program 1 times [2024-11-10 00:54:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:50,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857797188] [2024-11-10 00:54:50,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:50,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:54:51,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:51,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857797188] [2024-11-10 00:54:51,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857797188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:51,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:51,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:54:51,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534195963] [2024-11-10 00:54:51,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:51,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:54:51,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:51,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:54:51,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:54:51,077 INFO L87 Difference]: Start difference. First operand 16431 states and 25251 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:51,657 INFO L93 Difference]: Finished difference Result 31233 states and 46031 transitions. [2024-11-10 00:54:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:54:51,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 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-11-10 00:54:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:51,704 INFO L225 Difference]: With dead ends: 31233 [2024-11-10 00:54:51,704 INFO L226 Difference]: Without dead ends: 28094 [2024-11-10 00:54:51,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:54:51,720 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 9066 mSDsluCounter, 2722 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9066 SdHoareTripleChecker+Valid, 5019 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:51,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9066 Valid, 5019 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:54:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28094 states. [2024-11-10 00:54:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28094 to 19567. [2024-11-10 00:54:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19567 states, 19565 states have (on average 1.5130590339892664) internal successors, (29603), 19566 states have internal predecessors, (29603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19567 states to 19567 states and 29603 transitions. [2024-11-10 00:54:52,401 INFO L78 Accepts]: Start accepts. Automaton has 19567 states and 29603 transitions. Word has length 81 [2024-11-10 00:54:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:52,401 INFO L471 AbstractCegarLoop]: Abstraction has 19567 states and 29603 transitions. [2024-11-10 00:54:52,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 19567 states and 29603 transitions. [2024-11-10 00:54:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:54:52,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:52,405 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:54:52,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:54:52,405 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:52,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:52,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1240619397, now seen corresponding path program 1 times [2024-11-10 00:54:52,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:52,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599763242] [2024-11-10 00:54:52,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:52,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:54:52,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:52,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599763242] [2024-11-10 00:54:52,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599763242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:52,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:52,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:54:52,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107310308] [2024-11-10 00:54:52,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:52,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:54:52,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:52,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:54:52,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:54:52,570 INFO L87 Difference]: Start difference. First operand 19567 states and 29603 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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-11-10 00:54:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:53,016 INFO L93 Difference]: Finished difference Result 32577 states and 47919 transitions. [2024-11-10 00:54:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:54:53,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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 81 [2024-11-10 00:54:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:53,063 INFO L225 Difference]: With dead ends: 32577 [2024-11-10 00:54:53,064 INFO L226 Difference]: Without dead ends: 30334 [2024-11-10 00:54:53,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:54:53,079 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 9054 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9054 SdHoareTripleChecker+Valid, 5099 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:53,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9054 Valid, 5099 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:54:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30334 states. [2024-11-10 00:54:53,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30334 to 21807. [2024-11-10 00:54:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21807 states, 21805 states have (on average 1.5014446227929374) internal successors, (32739), 21806 states have internal predecessors, (32739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21807 states to 21807 states and 32739 transitions. [2024-11-10 00:54:53,897 INFO L78 Accepts]: Start accepts. Automaton has 21807 states and 32739 transitions. Word has length 81 [2024-11-10 00:54:53,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:53,898 INFO L471 AbstractCegarLoop]: Abstraction has 21807 states and 32739 transitions. [2024-11-10 00:54:53,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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-11-10 00:54:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 21807 states and 32739 transitions. [2024-11-10 00:54:53,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:54:53,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:53,903 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:54:53,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:54:53,903 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:53,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash 33226279, now seen corresponding path program 1 times [2024-11-10 00:54:53,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:53,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899746885] [2024-11-10 00:54:53,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:53,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:54,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:54,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899746885] [2024-11-10 00:54:54,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899746885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:54,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:54,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:54,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635535050] [2024-11-10 00:54:54,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:54,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:54,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:54,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:54,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:54,041 INFO L87 Difference]: Start difference. First operand 21807 states and 32739 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-11-10 00:54:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:54,504 INFO L93 Difference]: Finished difference Result 36394 states and 53149 transitions. [2024-11-10 00:54:54,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:54,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-11-10 00:54:54,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:54,525 INFO L225 Difference]: With dead ends: 36394 [2024-11-10 00:54:54,525 INFO L226 Difference]: Without dead ends: 16887 [2024-11-10 00:54:54,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:54,545 INFO L432 NwaCegarLoop]: 2270 mSDtfsCounter, 48 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4486 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:54,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4486 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16887 states. [2024-11-10 00:54:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16887 to 16877. [2024-11-10 00:54:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16877 states, 16875 states have (on average 1.5313185185185185) internal successors, (25841), 16876 states have internal predecessors, (25841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16877 states to 16877 states and 25841 transitions. [2024-11-10 00:54:54,933 INFO L78 Accepts]: Start accepts. Automaton has 16877 states and 25841 transitions. Word has length 83 [2024-11-10 00:54:54,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:54,934 INFO L471 AbstractCegarLoop]: Abstraction has 16877 states and 25841 transitions. [2024-11-10 00:54:54,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-11-10 00:54:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 16877 states and 25841 transitions. [2024-11-10 00:54:54,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:54:54,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:54,938 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:54:54,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:54:54,938 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:54,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:54,939 INFO L85 PathProgramCache]: Analyzing trace with hash 523692775, now seen corresponding path program 1 times [2024-11-10 00:54:54,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:54,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571571761] [2024-11-10 00:54:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:54,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:55,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:55,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571571761] [2024-11-10 00:54:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571571761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:55,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:55,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:55,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270058028] [2024-11-10 00:54:55,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:55,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:55,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:55,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:55,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:55,071 INFO L87 Difference]: Start difference. First operand 16877 states and 25841 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-11-10 00:54:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:55,329 INFO L93 Difference]: Finished difference Result 24163 states and 35933 transitions. [2024-11-10 00:54:55,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:55,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-11-10 00:54:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:55,345 INFO L225 Difference]: With dead ends: 24163 [2024-11-10 00:54:55,346 INFO L226 Difference]: Without dead ends: 9600 [2024-11-10 00:54:55,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:55,361 INFO L432 NwaCegarLoop]: 2263 mSDtfsCounter, 43 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4471 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:55,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4471 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:55,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9600 states. [2024-11-10 00:54:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9600 to 9597. [2024-11-10 00:54:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9597 states, 9595 states have (on average 1.6309536216779572) internal successors, (15649), 9596 states have internal predecessors, (15649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9597 states to 9597 states and 15649 transitions. [2024-11-10 00:54:55,622 INFO L78 Accepts]: Start accepts. Automaton has 9597 states and 15649 transitions. Word has length 83 [2024-11-10 00:54:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:55,622 INFO L471 AbstractCegarLoop]: Abstraction has 9597 states and 15649 transitions. [2024-11-10 00:54:55,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-11-10 00:54:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 9597 states and 15649 transitions. [2024-11-10 00:54:55,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 00:54:55,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:55,625 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:54:55,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:54:55,625 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:55,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1197682903, now seen corresponding path program 1 times [2024-11-10 00:54:55,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:55,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032692737] [2024-11-10 00:54:55,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:55,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:55,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:55,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032692737] [2024-11-10 00:54:55,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032692737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:55,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:55,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:55,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307900334] [2024-11-10 00:54:55,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:55,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:55,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:55,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:55,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:55,776 INFO L87 Difference]: Start difference. First operand 9597 states and 15649 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 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-11-10 00:54:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:55,882 INFO L93 Difference]: Finished difference Result 13243 states and 20645 transitions. [2024-11-10 00:54:55,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:55,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 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-11-10 00:54:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:55,891 INFO L225 Difference]: With dead ends: 13243 [2024-11-10 00:54:55,891 INFO L226 Difference]: Without dead ends: 5960 [2024-11-10 00:54:55,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:55,898 INFO L432 NwaCegarLoop]: 2256 mSDtfsCounter, 38 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4456 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:55,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4456 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2024-11-10 00:54:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 5957. [2024-11-10 00:54:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5957 states, 5955 states have (on average 1.7808564231738035) internal successors, (10605), 5956 states have internal predecessors, (10605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5957 states to 5957 states and 10605 transitions. [2024-11-10 00:54:55,997 INFO L78 Accepts]: Start accepts. Automaton has 5957 states and 10605 transitions. Word has length 85 [2024-11-10 00:54:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:55,997 INFO L471 AbstractCegarLoop]: Abstraction has 5957 states and 10605 transitions. [2024-11-10 00:54:55,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 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-11-10 00:54:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5957 states and 10605 transitions. [2024-11-10 00:54:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 00:54:55,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:55,999 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:54:56,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:54:56,000 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:56,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1769393264, now seen corresponding path program 1 times [2024-11-10 00:54:56,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:56,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338054281] [2024-11-10 00:54:56,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:56,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:56,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338054281] [2024-11-10 00:54:56,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338054281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:56,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:56,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:56,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673579692] [2024-11-10 00:54:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:56,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:56,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:56,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:56,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:56,104 INFO L87 Difference]: Start difference. First operand 5957 states and 10605 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-11-10 00:54:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:56,167 INFO L93 Difference]: Finished difference Result 7783 states and 13079 transitions. [2024-11-10 00:54:56,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:56,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-11-10 00:54:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:56,175 INFO L225 Difference]: With dead ends: 7783 [2024-11-10 00:54:56,175 INFO L226 Difference]: Without dead ends: 4140 [2024-11-10 00:54:56,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:56,180 INFO L432 NwaCegarLoop]: 2249 mSDtfsCounter, 35 mSDsluCounter, 2192 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:56,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 4441 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2024-11-10 00:54:56,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 4137. [2024-11-10 00:54:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4137 states, 4135 states have (on average 1.9610640870616687) internal successors, (8109), 4136 states have internal predecessors, (8109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 8109 transitions. [2024-11-10 00:54:56,263 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 8109 transitions. Word has length 87 [2024-11-10 00:54:56,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:56,263 INFO L471 AbstractCegarLoop]: Abstraction has 4137 states and 8109 transitions. [2024-11-10 00:54:56,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-11-10 00:54:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 8109 transitions. [2024-11-10 00:54:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 00:54:56,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:56,265 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:54:56,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:54:56,266 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:56,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:56,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1728874217, now seen corresponding path program 1 times [2024-11-10 00:54:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:56,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527420356] [2024-11-10 00:54:56,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:56,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:56,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:56,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527420356] [2024-11-10 00:54:56,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527420356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:56,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:56,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:56,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449597831] [2024-11-10 00:54:56,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:56,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:56,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:56,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:56,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:56,361 INFO L87 Difference]: Start difference. First operand 4137 states and 8109 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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-11-10 00:54:56,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:56,406 INFO L93 Difference]: Finished difference Result 5053 states and 9335 transitions. [2024-11-10 00:54:56,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:56,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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-11-10 00:54:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:56,413 INFO L225 Difference]: With dead ends: 5053 [2024-11-10 00:54:56,414 INFO L226 Difference]: Without dead ends: 3230 [2024-11-10 00:54:56,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:56,417 INFO L432 NwaCegarLoop]: 2242 mSDtfsCounter, 32 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4426 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:56,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4426 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2024-11-10 00:54:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3227. [2024-11-10 00:54:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 3225 states have (on average 2.1314728682170543) internal successors, (6874), 3226 states have internal predecessors, (6874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 6874 transitions. [2024-11-10 00:54:56,473 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 6874 transitions. Word has length 89 [2024-11-10 00:54:56,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:56,474 INFO L471 AbstractCegarLoop]: Abstraction has 3227 states and 6874 transitions. [2024-11-10 00:54:56,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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-11-10 00:54:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 6874 transitions. [2024-11-10 00:54:56,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:54:56,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:56,475 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:54:56,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:54:56,476 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:56,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:56,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1030885310, now seen corresponding path program 1 times [2024-11-10 00:54:56,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:56,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204922380] [2024-11-10 00:54:56,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:56,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:56,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:56,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204922380] [2024-11-10 00:54:56,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204922380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:54:56,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716242753] [2024-11-10 00:54:56,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:56,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:54:56,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:54:56,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:54:56,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:54:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:57,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 00:54:57,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:54:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:58,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:00,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716242753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:00,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:00,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 30 [2024-11-10 00:55:00,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257056567] [2024-11-10 00:55:00,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:00,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 00:55:00,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:00,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 00:55:00,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2024-11-10 00:55:00,141 INFO L87 Difference]: Start difference. First operand 3227 states and 6874 transitions. Second operand has 30 states, 30 states have (on average 7.833333333333333) internal successors, (235), 30 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:01,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:01,677 INFO L93 Difference]: Finished difference Result 6105 states and 10695 transitions. [2024-11-10 00:55:01,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 00:55:01,678 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.833333333333333) internal successors, (235), 30 states have internal predecessors, (235), 0 states have call successors, (0), 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 91 [2024-11-10 00:55:01,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:01,686 INFO L225 Difference]: With dead ends: 6105 [2024-11-10 00:55:01,687 INFO L226 Difference]: Without dead ends: 5192 [2024-11-10 00:55:01,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=714, Invalid=2366, Unknown=0, NotChecked=0, Total=3080 [2024-11-10 00:55:01,691 INFO L432 NwaCegarLoop]: 2197 mSDtfsCounter, 22821 mSDsluCounter, 9156 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22821 SdHoareTripleChecker+Valid, 11353 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:01,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22821 Valid, 11353 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:55:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5192 states. [2024-11-10 00:55:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5192 to 5099. [2024-11-10 00:55:01,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5099 states, 5097 states have (on average 1.8281341965862272) internal successors, (9318), 5098 states have internal predecessors, (9318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 9318 transitions. [2024-11-10 00:55:01,814 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 9318 transitions. Word has length 91 [2024-11-10 00:55:01,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:01,814 INFO L471 AbstractCegarLoop]: Abstraction has 5099 states and 9318 transitions. [2024-11-10 00:55:01,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.833333333333333) internal successors, (235), 30 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 9318 transitions. [2024-11-10 00:55:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:55:01,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:01,816 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:01,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:55:02,017 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,SelfDestructingSolverStorable22 [2024-11-10 00:55:02,018 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:02,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:02,018 INFO L85 PathProgramCache]: Analyzing trace with hash -711267938, now seen corresponding path program 1 times [2024-11-10 00:55:02,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:02,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531225278] [2024-11-10 00:55:02,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:02,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:03,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:03,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531225278] [2024-11-10 00:55:03,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531225278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:03,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81873042] [2024-11-10 00:55:03,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:03,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:03,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:03,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:55:03,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:55:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:03,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:55:03,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:03,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:04,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81873042] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:04,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:04,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-11-10 00:55:04,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827044748] [2024-11-10 00:55:04,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:04,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 00:55:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:04,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 00:55:04,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2024-11-10 00:55:04,471 INFO L87 Difference]: Start difference. First operand 5099 states and 9318 transitions. Second operand has 28 states, 28 states have (on average 8.607142857142858) internal successors, (241), 27 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:06,364 INFO L93 Difference]: Finished difference Result 18669 states and 27157 transitions. [2024-11-10 00:55:06,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-10 00:55:06,365 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.607142857142858) internal successors, (241), 27 states have internal predecessors, (241), 0 states have call successors, (0), 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 91 [2024-11-10 00:55:06,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:06,391 INFO L225 Difference]: With dead ends: 18669 [2024-11-10 00:55:06,391 INFO L226 Difference]: Without dead ends: 15884 [2024-11-10 00:55:06,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=710, Invalid=3072, Unknown=0, NotChecked=0, Total=3782 [2024-11-10 00:55:06,400 INFO L432 NwaCegarLoop]: 2192 mSDtfsCounter, 28079 mSDsluCounter, 13517 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28079 SdHoareTripleChecker+Valid, 15709 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:06,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28079 Valid, 15709 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:55:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15884 states. [2024-11-10 00:55:06,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15884 to 14537. [2024-11-10 00:55:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14537 states, 14535 states have (on average 1.4791193670450637) internal successors, (21499), 14536 states have internal predecessors, (21499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14537 states to 14537 states and 21499 transitions. [2024-11-10 00:55:06,734 INFO L78 Accepts]: Start accepts. Automaton has 14537 states and 21499 transitions. Word has length 91 [2024-11-10 00:55:06,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:06,734 INFO L471 AbstractCegarLoop]: Abstraction has 14537 states and 21499 transitions. [2024-11-10 00:55:06,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.607142857142858) internal successors, (241), 27 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 14537 states and 21499 transitions. [2024-11-10 00:55:06,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:55:06,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:06,737 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:06,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:55:06,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 00:55:06,938 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:06,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash 561044350, now seen corresponding path program 1 times [2024-11-10 00:55:06,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:06,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040255660] [2024-11-10 00:55:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:07,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:07,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040255660] [2024-11-10 00:55:07,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040255660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:07,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459944328] [2024-11-10 00:55:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:07,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:07,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:07,691 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:55:07,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:55:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:07,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 00:55:07,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:08,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:09,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459944328] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:09,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:09,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2024-11-10 00:55:09,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476833526] [2024-11-10 00:55:09,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:09,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-10 00:55:09,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:09,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-10 00:55:09,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 00:55:09,490 INFO L87 Difference]: Start difference. First operand 14537 states and 21499 transitions. Second operand has 35 states, 35 states have (on average 7.228571428571429) internal successors, (253), 35 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:13,541 INFO L93 Difference]: Finished difference Result 57140 states and 77448 transitions. [2024-11-10 00:55:13,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-10 00:55:13,542 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.228571428571429) internal successors, (253), 35 states have internal predecessors, (253), 0 states have call successors, (0), 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 91 [2024-11-10 00:55:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:13,589 INFO L225 Difference]: With dead ends: 57140 [2024-11-10 00:55:13,590 INFO L226 Difference]: Without dead ends: 44917 [2024-11-10 00:55:13,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1734 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1307, Invalid=5665, Unknown=0, NotChecked=0, Total=6972 [2024-11-10 00:55:13,604 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 25215 mSDsluCounter, 11909 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25215 SdHoareTripleChecker+Valid, 14114 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:13,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25215 Valid, 14114 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 00:55:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44917 states. [2024-11-10 00:55:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44917 to 40069. [2024-11-10 00:55:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40069 states, 40067 states have (on average 1.3571268125889135) internal successors, (54376), 40068 states have internal predecessors, (54376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40069 states to 40069 states and 54376 transitions. [2024-11-10 00:55:14,524 INFO L78 Accepts]: Start accepts. Automaton has 40069 states and 54376 transitions. Word has length 91 [2024-11-10 00:55:14,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:14,525 INFO L471 AbstractCegarLoop]: Abstraction has 40069 states and 54376 transitions. [2024-11-10 00:55:14,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.228571428571429) internal successors, (253), 35 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:14,525 INFO L276 IsEmpty]: Start isEmpty. Operand 40069 states and 54376 transitions. [2024-11-10 00:55:14,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:55:14,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:14,530 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:14,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 00:55:14,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:14,731 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:14,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:14,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1829072954, now seen corresponding path program 1 times [2024-11-10 00:55:14,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:14,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893645622] [2024-11-10 00:55:14,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:14,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:15,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:15,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893645622] [2024-11-10 00:55:15,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893645622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:15,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677290556] [2024-11-10 00:55:15,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:15,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:15,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:15,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:55:15,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:55:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:15,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 00:55:15,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:18,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:22,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677290556] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:22,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:22,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 23] total 51 [2024-11-10 00:55:22,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960092710] [2024-11-10 00:55:22,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:22,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-10 00:55:22,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:22,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-10 00:55:22,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2295, Unknown=0, NotChecked=0, Total=2550 [2024-11-10 00:55:22,671 INFO L87 Difference]: Start difference. First operand 40069 states and 54376 transitions. Second operand has 51 states, 51 states have (on average 5.03921568627451) internal successors, (257), 51 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)