./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.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.8.ufo.UNBOUNDED.pals+Problem12_label09.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 4b8e4f57289bafd3f29582b11c1ea3d32af0aa4d03b738aef04f29eb11d15fcf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:04:45,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:04:46,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 01:04:46,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:04:46,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:04:46,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:04:46,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:04:46,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:04:46,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:04:46,065 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:04:46,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:04:46,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:04:46,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:04:46,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:04:46,069 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:04:46,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:04:46,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:04:46,070 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 01:04:46,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:04:46,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 01:04:46,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:04:46,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:04:46,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:04:46,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:04:46,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:04:46,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 01:04:46,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:04:46,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:04:46,076 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:04:46,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:04:46,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:04:46,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:04:46,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:04:46,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:04:46,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:04:46,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:04:46,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:04:46,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:04:46,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:04:46,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:04:46,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:04:46,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:04:46,084 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 -> 4b8e4f57289bafd3f29582b11c1ea3d32af0aa4d03b738aef04f29eb11d15fcf [2024-11-10 01:04:46,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:04:46,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:04:46,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:04:46,388 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:04:46,389 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:04:46,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 01:04:47,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:04:48,473 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:04:48,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 01:04:48,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10c86950/a1c18cfbf8a2444cbd98af36d5f503c2/FLAG4a95ae1de [2024-11-10 01:04:49,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10c86950/a1c18cfbf8a2444cbd98af36d5f503c2 [2024-11-10 01:04:49,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:04:49,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:04:49,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:04:49,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:04:49,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:04:49,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:04:49" (1/1) ... [2024-11-10 01:04:49,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72df3efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:49, skipping insertion in model container [2024-11-10 01:04:49,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:04:49" (1/1) ... [2024-11-10 01:04:49,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:04:49,620 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.8.ufo.UNBOUNDED.pals+Problem12_label09.c[26888,26901] [2024-11-10 01:04:49,713 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.8.ufo.UNBOUNDED.pals+Problem12_label09.c[34636,34649] [2024-11-10 01:04:50,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:04:50,337 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:04:50,394 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.8.ufo.UNBOUNDED.pals+Problem12_label09.c[26888,26901] [2024-11-10 01:04:50,414 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.8.ufo.UNBOUNDED.pals+Problem12_label09.c[34636,34649] [2024-11-10 01:04:50,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:04:50,896 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:04:50,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:50 WrapperNode [2024-11-10 01:04:50,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:04:50,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:04:50,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:04:50,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:04:50,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:50" (1/1) ... [2024-11-10 01:04:50,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:50" (1/1) ... [2024-11-10 01:04:51,365 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5289 [2024-11-10 01:04:51,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:04:51,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:04:51,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:04:51,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:04:51,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:50" (1/1) ... [2024-11-10 01:04:51,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:50" (1/1) ... [2024-11-10 01:04:51,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:50" (1/1) ... [2024-11-10 01:04:51,611 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 01:04:51,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:50" (1/1) ... [2024-11-10 01:04:51,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:50" (1/1) ... [2024-11-10 01:04:51,772 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:50" (1/1) ... [2024-11-10 01:04:51,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:50" (1/1) ... [2024-11-10 01:04:51,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:50" (1/1) ... [2024-11-10 01:04:51,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:50" (1/1) ... [2024-11-10 01:04:51,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:04:51,945 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:04:51,946 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:04:51,946 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:04:51,947 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:50" (1/1) ... [2024-11-10 01:04:51,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:04:51,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:04:51,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 01:04:51,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 01:04:52,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:04:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:04:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:04:52,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:04:52,195 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:04:52,197 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:04:57,958 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc calculate_output_#t~ret49#1; [2024-11-10 01:04:57,959 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3854: havoc calculate_output2_#t~ret50#1; [2024-11-10 01:04:57,959 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5344: havoc calculate_output3_#t~ret51#1; [2024-11-10 01:04:58,306 INFO L? ?]: Removed 2096 outVars from TransFormulas that were not future-live. [2024-11-10 01:04:58,306 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:04:58,347 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:04:58,348 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:04:58,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:04:58 BoogieIcfgContainer [2024-11-10 01:04:58,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:04:58,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:04:58,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:04:58,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:04:58,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:04:49" (1/3) ... [2024-11-10 01:04:58,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62431db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:04:58, skipping insertion in model container [2024-11-10 01:04:58,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:50" (2/3) ... [2024-11-10 01:04:58,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62431db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:04:58, skipping insertion in model container [2024-11-10 01:04:58,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:04:58" (3/3) ... [2024-11-10 01:04:58,359 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 01:04:58,377 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:04:58,377 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 01:04:58,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:04:58,491 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;@4233c09a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:04:58,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 01:04:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 956 states, 953 states have (on average 2.6096537250786986) internal successors, (2487), 955 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:04:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 01:04:58,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:58,513 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] [2024-11-10 01:04:58,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:58,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:58,519 INFO L85 PathProgramCache]: Analyzing trace with hash -759466470, now seen corresponding path program 1 times [2024-11-10 01:04:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:58,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22000132] [2024-11-10 01:04:58,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:58,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:04:58,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:58,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22000132] [2024-11-10 01:04:58,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22000132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:58,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:58,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:04:58,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380150668] [2024-11-10 01:04:58,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:58,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:04:58,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:58,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:04:58,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:04:58,940 INFO L87 Difference]: Start difference. First operand has 956 states, 953 states have (on average 2.6096537250786986) internal successors, (2487), 955 states have internal predecessors, (2487), 0 states have call successors, (0), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:04:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:59,055 INFO L93 Difference]: Finished difference Result 1841 states and 4840 transitions. [2024-11-10 01:04:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:04:59,058 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-10 01:04:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:59,084 INFO L225 Difference]: With dead ends: 1841 [2024-11-10 01:04:59,085 INFO L226 Difference]: Without dead ends: 888 [2024-11-10 01:04:59,092 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 01:04:59,100 INFO L432 NwaCegarLoop]: 2416 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, 2416 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 01:04:59,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-11-10 01:04:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2024-11-10 01:04:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 886 states have (on average 2.654627539503386) internal successors, (2352), 887 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:04:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 2352 transitions. [2024-11-10 01:04:59,205 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 2352 transitions. Word has length 32 [2024-11-10 01:04:59,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:59,205 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 2352 transitions. [2024-11-10 01:04:59,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:04:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 2352 transitions. [2024-11-10 01:04:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 01:04:59,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:59,209 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] [2024-11-10 01:04:59,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:04:59,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:59,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash -728446663, now seen corresponding path program 1 times [2024-11-10 01:04:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:59,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002341297] [2024-11-10 01:04:59,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:59,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:04:59,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:59,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002341297] [2024-11-10 01:04:59,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002341297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:59,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:59,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:04:59,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413008586] [2024-11-10 01:04:59,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:59,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:04:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:59,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:04:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:04:59,522 INFO L87 Difference]: Start difference. First operand 888 states and 2352 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:04:59,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:59,748 INFO L93 Difference]: Finished difference Result 957 states and 2459 transitions. [2024-11-10 01:04:59,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:04:59,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-10 01:04:59,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:59,754 INFO L225 Difference]: With dead ends: 957 [2024-11-10 01:04:59,755 INFO L226 Difference]: Without dead ends: 888 [2024-11-10 01:04:59,756 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 01:04:59,757 INFO L432 NwaCegarLoop]: 2350 mSDtfsCounter, 0 mSDsluCounter, 6984 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9334 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:59,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9334 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:04:59,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-11-10 01:04:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2024-11-10 01:04:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 886 states have (on average 2.5857787810383748) internal successors, (2291), 887 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:04:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 2291 transitions. [2024-11-10 01:04:59,787 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 2291 transitions. Word has length 32 [2024-11-10 01:04:59,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:59,789 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 2291 transitions. [2024-11-10 01:04:59,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:04:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 2291 transitions. [2024-11-10 01:04:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 01:04:59,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:59,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:59,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:04:59,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:59,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:59,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1407345729, now seen corresponding path program 1 times [2024-11-10 01:04:59,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:59,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708066585] [2024-11-10 01:04:59,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:59,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:05:00,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:00,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708066585] [2024-11-10 01:05:00,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708066585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:00,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:00,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:00,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997074812] [2024-11-10 01:05:00,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:00,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:05:00,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:00,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:05:00,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:05:00,070 INFO L87 Difference]: Start difference. First operand 888 states and 2291 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:08,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:08,213 INFO L93 Difference]: Finished difference Result 3147 states and 8644 transitions. [2024-11-10 01:05:08,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:05:08,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-10 01:05:08,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:08,226 INFO L225 Difference]: With dead ends: 3147 [2024-11-10 01:05:08,226 INFO L226 Difference]: Without dead ends: 2392 [2024-11-10 01:05:08,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:05:08,229 INFO L432 NwaCegarLoop]: 865 mSDtfsCounter, 4567 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 9119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:08,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4567 Valid, 888 Invalid, 9119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2024-11-10 01:05:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2024-11-10 01:05:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2392. [2024-11-10 01:05:08,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 2390 states have (on average 2.3552301255230126) internal successors, (5629), 2391 states have internal predecessors, (5629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 5629 transitions. [2024-11-10 01:05:08,322 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 5629 transitions. Word has length 69 [2024-11-10 01:05:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:08,322 INFO L471 AbstractCegarLoop]: Abstraction has 2392 states and 5629 transitions. [2024-11-10 01:05:08,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 5629 transitions. [2024-11-10 01:05:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 01:05:08,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:08,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:08,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:05:08,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:08,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:08,332 INFO L85 PathProgramCache]: Analyzing trace with hash -234036099, now seen corresponding path program 1 times [2024-11-10 01:05:08,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:08,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415146945] [2024-11-10 01:05:08,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:08,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:05:08,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:08,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415146945] [2024-11-10 01:05:08,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415146945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:08,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:08,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:05:08,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746411157] [2024-11-10 01:05:08,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:08,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:05:08,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:08,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:05:08,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:05:08,820 INFO L87 Difference]: Start difference. First operand 2392 states and 5629 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:09,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:09,385 INFO L93 Difference]: Finished difference Result 3432 states and 7277 transitions. [2024-11-10 01:05:09,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 01:05:09,387 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-10 01:05:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:09,405 INFO L225 Difference]: With dead ends: 3432 [2024-11-10 01:05:09,406 INFO L226 Difference]: Without dead ends: 3367 [2024-11-10 01:05:09,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-10 01:05:09,412 INFO L432 NwaCegarLoop]: 2285 mSDtfsCounter, 19002 mSDsluCounter, 4183 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19002 SdHoareTripleChecker+Valid, 6468 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:09,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19002 Valid, 6468 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:05:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2024-11-10 01:05:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 2454. [2024-11-10 01:05:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2454 states, 2452 states have (on average 2.33605220228385) internal successors, (5728), 2453 states have internal predecessors, (5728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 5728 transitions. [2024-11-10 01:05:09,489 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 5728 transitions. Word has length 92 [2024-11-10 01:05:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:09,490 INFO L471 AbstractCegarLoop]: Abstraction has 2454 states and 5728 transitions. [2024-11-10 01:05:09,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 5728 transitions. [2024-11-10 01:05:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 01:05:09,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:09,492 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:09,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:05:09,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:09,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash 718968799, now seen corresponding path program 1 times [2024-11-10 01:05:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:09,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320977421] [2024-11-10 01:05:09,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:09,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:05:10,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:10,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320977421] [2024-11-10 01:05:10,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320977421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:10,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:10,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:05:10,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565294106] [2024-11-10 01:05:10,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:10,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:05:10,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:10,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:05:10,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:05:10,089 INFO L87 Difference]: Start difference. First operand 2454 states and 5728 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:10,568 INFO L93 Difference]: Finished difference Result 2584 states and 5932 transitions. [2024-11-10 01:05:10,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:05:10,569 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-10 01:05:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:10,581 INFO L225 Difference]: With dead ends: 2584 [2024-11-10 01:05:10,582 INFO L226 Difference]: Without dead ends: 2457 [2024-11-10 01:05:10,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-10 01:05:10,584 INFO L432 NwaCegarLoop]: 2281 mSDtfsCounter, 15435 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15435 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:10,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15435 Valid, 2987 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:05:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2024-11-10 01:05:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2454. [2024-11-10 01:05:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2454 states, 2452 states have (on average 2.3356443719412723) internal successors, (5727), 2453 states have internal predecessors, (5727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 5727 transitions. [2024-11-10 01:05:10,644 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 5727 transitions. Word has length 94 [2024-11-10 01:05:10,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:10,644 INFO L471 AbstractCegarLoop]: Abstraction has 2454 states and 5727 transitions. [2024-11-10 01:05:10,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 5727 transitions. [2024-11-10 01:05:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 01:05:10,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:10,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:10,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:05:10,646 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:10,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:10,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1757951802, now seen corresponding path program 1 times [2024-11-10 01:05:10,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:10,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227378519] [2024-11-10 01:05:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:10,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:05:10,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:10,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227378519] [2024-11-10 01:05:10,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227378519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:10,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:10,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139837788] [2024-11-10 01:05:10,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:10,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:10,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:10,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:10,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:10,779 INFO L87 Difference]: Start difference. First operand 2454 states and 5727 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:10,824 INFO L93 Difference]: Finished difference Result 2696 states and 6109 transitions. [2024-11-10 01:05:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:10,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-10 01:05:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:10,836 INFO L225 Difference]: With dead ends: 2696 [2024-11-10 01:05:10,837 INFO L226 Difference]: Without dead ends: 2569 [2024-11-10 01:05:10,838 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 01:05:10,839 INFO L432 NwaCegarLoop]: 2287 mSDtfsCounter, 2192 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2192 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:10,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2192 Valid, 2383 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2024-11-10 01:05:10,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2564. [2024-11-10 01:05:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2562 states have (on average 2.3024980483996877) internal successors, (5899), 2563 states have internal predecessors, (5899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:10,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 5899 transitions. [2024-11-10 01:05:10,899 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 5899 transitions. Word has length 95 [2024-11-10 01:05:10,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:10,900 INFO L471 AbstractCegarLoop]: Abstraction has 2564 states and 5899 transitions. [2024-11-10 01:05:10,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 5899 transitions. [2024-11-10 01:05:10,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:10,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:10,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:10,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:05:10,902 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:10,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:10,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1443423329, now seen corresponding path program 1 times [2024-11-10 01:05:10,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:10,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883668242] [2024-11-10 01:05:10,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:10,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 01:05:10,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:10,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883668242] [2024-11-10 01:05:10,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883668242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:10,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:10,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:10,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039014660] [2024-11-10 01:05:10,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:10,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:10,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:10,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:10,994 INFO L87 Difference]: Start difference. First operand 2564 states and 5899 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:11,041 INFO L93 Difference]: Finished difference Result 3022 states and 6617 transitions. [2024-11-10 01:05:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:11,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:05:11,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:11,056 INFO L225 Difference]: With dead ends: 3022 [2024-11-10 01:05:11,056 INFO L226 Difference]: Without dead ends: 2785 [2024-11-10 01:05:11,058 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 01:05:11,061 INFO L432 NwaCegarLoop]: 2370 mSDtfsCounter, 2211 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2211 SdHoareTripleChecker+Valid, 2478 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 01:05:11,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2211 Valid, 2478 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2024-11-10 01:05:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 2782. [2024-11-10 01:05:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2780 states have (on average 2.243884892086331) internal successors, (6238), 2781 states have internal predecessors, (6238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 6238 transitions. [2024-11-10 01:05:11,131 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 6238 transitions. Word has length 96 [2024-11-10 01:05:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:11,132 INFO L471 AbstractCegarLoop]: Abstraction has 2782 states and 6238 transitions. [2024-11-10 01:05:11,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 6238 transitions. [2024-11-10 01:05:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:11,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:11,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:11,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:05:11,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:11,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:11,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1743444063, now seen corresponding path program 1 times [2024-11-10 01:05:11,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:11,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320681244] [2024-11-10 01:05:11,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:05:11,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:11,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320681244] [2024-11-10 01:05:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320681244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:11,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:11,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:11,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054194525] [2024-11-10 01:05:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:11,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:11,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:11,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:11,230 INFO L87 Difference]: Start difference. First operand 2782 states and 6238 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:11,280 INFO L93 Difference]: Finished difference Result 3660 states and 7606 transitions. [2024-11-10 01:05:11,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:11,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:05:11,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:11,295 INFO L225 Difference]: With dead ends: 3660 [2024-11-10 01:05:11,295 INFO L226 Difference]: Without dead ends: 3205 [2024-11-10 01:05:11,298 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 01:05:11,298 INFO L432 NwaCegarLoop]: 2368 mSDtfsCounter, 2209 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 2480 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 01:05:11,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2209 Valid, 2480 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2024-11-10 01:05:11,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 3202. [2024-11-10 01:05:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3202 states, 3200 states have (on average 2.15125) internal successors, (6884), 3201 states have internal predecessors, (6884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 6884 transitions. [2024-11-10 01:05:11,393 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 6884 transitions. Word has length 96 [2024-11-10 01:05:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:11,394 INFO L471 AbstractCegarLoop]: Abstraction has 3202 states and 6884 transitions. [2024-11-10 01:05:11,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 6884 transitions. [2024-11-10 01:05:11,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:11,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:11,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:11,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:05:11,396 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:11,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1778982433, now seen corresponding path program 1 times [2024-11-10 01:05:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:11,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330240478] [2024-11-10 01:05:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:11,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:05:11,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:11,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330240478] [2024-11-10 01:05:11,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330240478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:11,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:11,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:11,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474962624] [2024-11-10 01:05:11,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:11,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:11,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:11,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:11,511 INFO L87 Difference]: Start difference. First operand 3202 states and 6884 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:11,579 INFO L93 Difference]: Finished difference Result 4888 states and 9488 transitions. [2024-11-10 01:05:11,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:11,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:05:11,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:11,602 INFO L225 Difference]: With dead ends: 4888 [2024-11-10 01:05:11,602 INFO L226 Difference]: Without dead ends: 4013 [2024-11-10 01:05:11,607 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 01:05:11,608 INFO L432 NwaCegarLoop]: 2356 mSDtfsCounter, 2205 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 2476 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 01:05:11,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2205 Valid, 2476 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2024-11-10 01:05:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 4010. [2024-11-10 01:05:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4010 states, 4008 states have (on average 2.0239520958083834) internal successors, (8112), 4009 states have internal predecessors, (8112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 8112 transitions. [2024-11-10 01:05:11,725 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 8112 transitions. Word has length 96 [2024-11-10 01:05:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:11,726 INFO L471 AbstractCegarLoop]: Abstraction has 4010 states and 8112 transitions. [2024-11-10 01:05:11,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 8112 transitions. [2024-11-10 01:05:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:11,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:11,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:11,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:05:11,729 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:11,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:11,730 INFO L85 PathProgramCache]: Analyzing trace with hash 777572705, now seen corresponding path program 1 times [2024-11-10 01:05:11,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:11,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153456558] [2024-11-10 01:05:11,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:11,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:05:11,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:11,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153456558] [2024-11-10 01:05:11,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153456558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:11,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:11,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:11,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399234311] [2024-11-10 01:05:11,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:11,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:11,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:11,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:11,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:11,816 INFO L87 Difference]: Start difference. First operand 4010 states and 8112 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:11,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:11,898 INFO L93 Difference]: Finished difference Result 7248 states and 13060 transitions. [2024-11-10 01:05:11,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:11,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:05:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:11,912 INFO L225 Difference]: With dead ends: 7248 [2024-11-10 01:05:11,912 INFO L226 Difference]: Without dead ends: 5565 [2024-11-10 01:05:11,981 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 01:05:11,983 INFO L432 NwaCegarLoop]: 2354 mSDtfsCounter, 2203 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2203 SdHoareTripleChecker+Valid, 2478 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 01:05:11,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2203 Valid, 2478 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5565 states. [2024-11-10 01:05:12,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5565 to 5562. [2024-11-10 01:05:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5562 states, 5560 states have (on average 1.8776978417266188) internal successors, (10440), 5561 states have internal predecessors, (10440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5562 states to 5562 states and 10440 transitions. [2024-11-10 01:05:12,141 INFO L78 Accepts]: Start accepts. Automaton has 5562 states and 10440 transitions. Word has length 96 [2024-11-10 01:05:12,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:12,141 INFO L471 AbstractCegarLoop]: Abstraction has 5562 states and 10440 transitions. [2024-11-10 01:05:12,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 5562 states and 10440 transitions. [2024-11-10 01:05:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:12,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:12,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:12,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:05:12,143 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:12,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:12,143 INFO L85 PathProgramCache]: Analyzing trace with hash 763122849, now seen corresponding path program 1 times [2024-11-10 01:05:12,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:12,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522765410] [2024-11-10 01:05:12,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:12,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:05:12,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:12,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522765410] [2024-11-10 01:05:12,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522765410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:12,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:12,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:12,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360104053] [2024-11-10 01:05:12,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:12,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:12,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:12,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:12,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:12,226 INFO L87 Difference]: Start difference. First operand 5562 states and 10440 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:12,349 INFO L93 Difference]: Finished difference Result 11776 states and 19820 transitions. [2024-11-10 01:05:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:12,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:05:12,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:12,367 INFO L225 Difference]: With dead ends: 11776 [2024-11-10 01:05:12,367 INFO L226 Difference]: Without dead ends: 8541 [2024-11-10 01:05:12,375 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 01:05:12,376 INFO L432 NwaCegarLoop]: 2352 mSDtfsCounter, 2201 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2201 SdHoareTripleChecker+Valid, 2480 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 01:05:12,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2201 Valid, 2480 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8541 states. [2024-11-10 01:05:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8541 to 8538. [2024-11-10 01:05:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8538 states, 8536 states have (on average 1.738519212746017) internal successors, (14840), 8537 states have internal predecessors, (14840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8538 states to 8538 states and 14840 transitions. [2024-11-10 01:05:12,619 INFO L78 Accepts]: Start accepts. Automaton has 8538 states and 14840 transitions. Word has length 96 [2024-11-10 01:05:12,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:12,619 INFO L471 AbstractCegarLoop]: Abstraction has 8538 states and 14840 transitions. [2024-11-10 01:05:12,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 8538 states and 14840 transitions. [2024-11-10 01:05:12,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:12,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:12,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:12,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:05:12,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:12,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:12,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1440241695, now seen corresponding path program 1 times [2024-11-10 01:05:12,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:12,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802741826] [2024-11-10 01:05:12,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:12,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:05:12,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:12,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802741826] [2024-11-10 01:05:12,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802741826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:12,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:12,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:12,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067107996] [2024-11-10 01:05:12,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:12,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:12,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:12,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:12,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:12,735 INFO L87 Difference]: Start difference. First operand 8538 states and 14840 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:12,949 INFO L93 Difference]: Finished difference Result 20448 states and 32572 transitions. [2024-11-10 01:05:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:12,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:05:12,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:12,983 INFO L225 Difference]: With dead ends: 20448 [2024-11-10 01:05:12,983 INFO L226 Difference]: Without dead ends: 14237 [2024-11-10 01:05:12,997 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 01:05:12,998 INFO L432 NwaCegarLoop]: 2350 mSDtfsCounter, 2199 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2199 SdHoareTripleChecker+Valid, 2482 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 01:05:12,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2199 Valid, 2482 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14237 states. [2024-11-10 01:05:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14237 to 14234. [2024-11-10 01:05:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14234 states, 14232 states have (on average 1.625070264193367) internal successors, (23128), 14233 states have internal predecessors, (23128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 23128 transitions. [2024-11-10 01:05:13,479 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 23128 transitions. Word has length 96 [2024-11-10 01:05:13,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:13,479 INFO L471 AbstractCegarLoop]: Abstraction has 14234 states and 23128 transitions. [2024-11-10 01:05:13,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 23128 transitions. [2024-11-10 01:05:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:13,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:13,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:13,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:05:13,486 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:13,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:13,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1964518750, now seen corresponding path program 1 times [2024-11-10 01:05:13,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:13,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851610313] [2024-11-10 01:05:13,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:13,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:05:13,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:13,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851610313] [2024-11-10 01:05:13,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851610313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:13,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:13,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:05:13,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990313253] [2024-11-10 01:05:13,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:13,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:05:13,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:13,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:05:13,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:05:13,875 INFO L87 Difference]: Start difference. First operand 14234 states and 23128 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:14,121 INFO L93 Difference]: Finished difference Result 14621 states and 23642 transitions. [2024-11-10 01:05:14,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:05:14,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:05:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:14,157 INFO L225 Difference]: With dead ends: 14621 [2024-11-10 01:05:14,157 INFO L226 Difference]: Without dead ends: 14618 [2024-11-10 01:05:14,166 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 01:05:14,168 INFO L432 NwaCegarLoop]: 2285 mSDtfsCounter, 0 mSDsluCounter, 13697 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15982 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 01:05:14,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15982 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:14,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14618 states. [2024-11-10 01:05:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14618 to 14618. [2024-11-10 01:05:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14618 states, 14616 states have (on average 1.6042692939244663) internal successors, (23448), 14617 states have internal predecessors, (23448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14618 states to 14618 states and 23448 transitions. [2024-11-10 01:05:14,730 INFO L78 Accepts]: Start accepts. Automaton has 14618 states and 23448 transitions. Word has length 96 [2024-11-10 01:05:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:14,730 INFO L471 AbstractCegarLoop]: Abstraction has 14618 states and 23448 transitions. [2024-11-10 01:05:14,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 14618 states and 23448 transitions. [2024-11-10 01:05:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:14,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:14,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:14,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:05:14,732 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:14,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2061056737, now seen corresponding path program 1 times [2024-11-10 01:05:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:14,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305269871] [2024-11-10 01:05:14,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:14,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:05:14,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:14,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305269871] [2024-11-10 01:05:14,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305269871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:14,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:14,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:14,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294494826] [2024-11-10 01:05:14,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:14,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:14,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:14,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:14,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:14,855 INFO L87 Difference]: Start difference. First operand 14618 states and 23448 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:15,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:15,404 INFO L93 Difference]: Finished difference Result 38176 states and 57500 transitions. [2024-11-10 01:05:15,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:15,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:05:15,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:15,468 INFO L225 Difference]: With dead ends: 38176 [2024-11-10 01:05:15,468 INFO L226 Difference]: Without dead ends: 25885 [2024-11-10 01:05:15,494 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 01:05:15,495 INFO L432 NwaCegarLoop]: 2366 mSDtfsCounter, 2207 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2207 SdHoareTripleChecker+Valid, 2482 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 01:05:15,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2207 Valid, 2482 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25885 states. [2024-11-10 01:05:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25885 to 25882. [2024-11-10 01:05:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25882 states, 25880 states have (on average 1.519319938176198) internal successors, (39320), 25881 states have internal predecessors, (39320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25882 states to 25882 states and 39320 transitions. [2024-11-10 01:05:16,198 INFO L78 Accepts]: Start accepts. Automaton has 25882 states and 39320 transitions. Word has length 96 [2024-11-10 01:05:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:16,199 INFO L471 AbstractCegarLoop]: Abstraction has 25882 states and 39320 transitions. [2024-11-10 01:05:16,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 25882 states and 39320 transitions. [2024-11-10 01:05:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 01:05:16,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:16,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:16,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:05:16,201 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:16,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash -360366943, now seen corresponding path program 1 times [2024-11-10 01:05:16,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:16,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526422690] [2024-11-10 01:05:16,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:16,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:05:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526422690] [2024-11-10 01:05:16,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526422690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:16,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:16,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:16,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920547460] [2024-11-10 01:05:16,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:16,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:16,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:16,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:16,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:16,414 INFO L87 Difference]: Start difference. First operand 25882 states and 39320 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:16,964 INFO L93 Difference]: Finished difference Result 50468 states and 74913 transitions. [2024-11-10 01:05:16,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:16,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-11-10 01:05:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:17,047 INFO L225 Difference]: With dead ends: 50468 [2024-11-10 01:05:17,047 INFO L226 Difference]: Without dead ends: 37408 [2024-11-10 01:05:17,080 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 01:05:17,081 INFO L432 NwaCegarLoop]: 2375 mSDtfsCounter, 2210 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2210 SdHoareTripleChecker+Valid, 2479 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 01:05:17,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2210 Valid, 2479 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:17,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37408 states. [2024-11-10 01:05:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37408 to 37405. [2024-11-10 01:05:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37405 states, 37403 states have (on average 1.4859503248402535) internal successors, (55579), 37404 states have internal predecessors, (55579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:18,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37405 states to 37405 states and 55579 transitions. [2024-11-10 01:05:18,103 INFO L78 Accepts]: Start accepts. Automaton has 37405 states and 55579 transitions. Word has length 98 [2024-11-10 01:05:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:18,103 INFO L471 AbstractCegarLoop]: Abstraction has 37405 states and 55579 transitions. [2024-11-10 01:05:18,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 37405 states and 55579 transitions. [2024-11-10 01:05:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:05:18,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:18,113 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:18,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:05:18,113 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:18,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:18,114 INFO L85 PathProgramCache]: Analyzing trace with hash -469450845, now seen corresponding path program 1 times [2024-11-10 01:05:18,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:18,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450504064] [2024-11-10 01:05:18,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:18,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:18,614 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 01:05:18,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:18,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450504064] [2024-11-10 01:05:18,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450504064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:18,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:18,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:05:18,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374362893] [2024-11-10 01:05:18,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:18,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:05:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:18,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:05:18,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:05:18,619 INFO L87 Difference]: Start difference. First operand 37405 states and 55579 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:23,225 INFO L93 Difference]: Finished difference Result 325176 states and 465837 transitions. [2024-11-10 01:05:23,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:05:23,226 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2024-11-10 01:05:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:24,075 INFO L225 Difference]: With dead ends: 325176 [2024-11-10 01:05:24,075 INFO L226 Difference]: Without dead ends: 290101 [2024-11-10 01:05:24,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:05:24,160 INFO L432 NwaCegarLoop]: 2401 mSDtfsCounter, 16563 mSDsluCounter, 4121 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16563 SdHoareTripleChecker+Valid, 6522 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:24,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16563 Valid, 6522 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:05:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290101 states. [2024-11-10 01:05:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290101 to 72477. [2024-11-10 01:05:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72477 states, 72475 states have (on average 1.452128320110383) internal successors, (105243), 72476 states have internal predecessors, (105243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72477 states to 72477 states and 105243 transitions. [2024-11-10 01:05:28,160 INFO L78 Accepts]: Start accepts. Automaton has 72477 states and 105243 transitions. Word has length 123 [2024-11-10 01:05:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:28,161 INFO L471 AbstractCegarLoop]: Abstraction has 72477 states and 105243 transitions. [2024-11-10 01:05:28,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 72477 states and 105243 transitions. [2024-11-10 01:05:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:05:28,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:28,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:28,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:05:28,172 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:28,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:28,173 INFO L85 PathProgramCache]: Analyzing trace with hash 638649059, now seen corresponding path program 1 times [2024-11-10 01:05:28,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:28,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422442840] [2024-11-10 01:05:28,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:28,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 01:05:28,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:28,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422442840] [2024-11-10 01:05:28,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422442840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:28,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:28,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:05:28,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597207045] [2024-11-10 01:05:28,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:28,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:05:28,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:28,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:05:28,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:05:28,476 INFO L87 Difference]: Start difference. First operand 72477 states and 105243 transitions. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:34,803 INFO L93 Difference]: Finished difference Result 360248 states and 515501 transitions. [2024-11-10 01:05:34,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:05:34,804 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2024-11-10 01:05:34,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:35,447 INFO L225 Difference]: With dead ends: 360248 [2024-11-10 01:05:35,447 INFO L226 Difference]: Without dead ends: 325173 [2024-11-10 01:05:35,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:05:35,539 INFO L432 NwaCegarLoop]: 2397 mSDtfsCounter, 16618 mSDsluCounter, 3903 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16618 SdHoareTripleChecker+Valid, 6300 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:35,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16618 Valid, 6300 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:05:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325173 states. [2024-11-10 01:05:40,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325173 to 125213. [2024-11-10 01:05:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125213 states, 125211 states have (on average 1.4334443459440465) internal successors, (179483), 125212 states have internal predecessors, (179483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125213 states to 125213 states and 179483 transitions. [2024-11-10 01:05:41,108 INFO L78 Accepts]: Start accepts. Automaton has 125213 states and 179483 transitions. Word has length 123 [2024-11-10 01:05:41,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:41,108 INFO L471 AbstractCegarLoop]: Abstraction has 125213 states and 179483 transitions. [2024-11-10 01:05:41,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 125213 states and 179483 transitions. [2024-11-10 01:05:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:05:41,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:41,122 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:41,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:05:41,122 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:41,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:41,123 INFO L85 PathProgramCache]: Analyzing trace with hash -133891741, now seen corresponding path program 1 times [2024-11-10 01:05:41,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:41,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166017244] [2024-11-10 01:05:41,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:41,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 01:05:41,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:41,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166017244] [2024-11-10 01:05:41,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166017244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:41,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:41,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:05:41,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667828302] [2024-11-10 01:05:41,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:41,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:05:41,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:41,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:05:41,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:05:41,429 INFO L87 Difference]: Start difference. First operand 125213 states and 179483 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:49,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:49,185 INFO L93 Difference]: Finished difference Result 395320 states and 565165 transitions. [2024-11-10 01:05:49,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:05:49,186 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 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 123 [2024-11-10 01:05:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:49,846 INFO L225 Difference]: With dead ends: 395320 [2024-11-10 01:05:49,846 INFO L226 Difference]: Without dead ends: 360245 [2024-11-10 01:05:49,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:05:49,935 INFO L432 NwaCegarLoop]: 2393 mSDtfsCounter, 16695 mSDsluCounter, 3897 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16695 SdHoareTripleChecker+Valid, 6290 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:49,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16695 Valid, 6290 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:05:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360245 states. [2024-11-10 01:05:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360245 to 160285. [2024-11-10 01:05:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160285 states, 160283 states have (on average 1.4296400741189021) internal successors, (229147), 160284 states have internal predecessors, (229147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160285 states to 160285 states and 229147 transitions. [2024-11-10 01:05:56,818 INFO L78 Accepts]: Start accepts. Automaton has 160285 states and 229147 transitions. Word has length 123 [2024-11-10 01:05:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:56,819 INFO L471 AbstractCegarLoop]: Abstraction has 160285 states and 229147 transitions. [2024-11-10 01:05:56,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 160285 states and 229147 transitions. [2024-11-10 01:05:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:05:56,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:56,834 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:56,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:05:56,835 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:56,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1135301469, now seen corresponding path program 1 times [2024-11-10 01:05:56,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:56,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108424554] [2024-11-10 01:05:56,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:56,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 01:05:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108424554] [2024-11-10 01:05:57,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108424554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:57,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:57,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:05:57,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214948569] [2024-11-10 01:05:57,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:57,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:05:57,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:57,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:05:57,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:05:57,608 INFO L87 Difference]: Start difference. First operand 160285 states and 229147 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)