./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 3289d67d 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-3289d67-m [2024-11-16 09:51:26,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:51:26,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 09:51:26,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:51:26,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:51:26,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:51:26,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:51:26,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:51:26,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:51:26,668 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:51:26,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:51:26,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:51:26,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:51:26,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:51:26,669 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:51:26,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:51:26,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:51:26,670 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:51:26,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 09:51:26,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:51:26,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:51:26,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:51:26,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:51:26,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:51:26,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:51:26,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:51:26,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:51:26,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:51:26,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:51:26,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:51:26,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:51:26,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:51:26,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:51:26,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:51:26,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:51:26,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:51:26,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 09:51:26,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 09:51:26,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:51:26,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:51:26,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:51:26,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:51:26,677 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-16 09:51:26,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:51:26,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:51:26,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:51:26,890 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:51:26,891 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:51:26,891 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-16 09:51:28,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:51:28,422 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:51:28,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-16 09:51:28,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adb6b336d/fce67bd35e464fe89b664b82a1cc8da3/FLAGe06d67eea [2024-11-16 09:51:28,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adb6b336d/fce67bd35e464fe89b664b82a1cc8da3 [2024-11-16 09:51:28,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:51:28,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:51:28,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:51:28,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:51:28,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:51:28,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:51:28" (1/1) ... [2024-11-16 09:51:28,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac05bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:28, skipping insertion in model container [2024-11-16 09:51:28,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:51:28" (1/1) ... [2024-11-16 09:51:28,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:51:29,074 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-16 09:51:29,137 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-16 09:51:29,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:51:29,631 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:51:29,658 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-16 09:51:29,666 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-16 09:51:29,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:51:30,023 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:51:30,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:30 WrapperNode [2024-11-16 09:51:30,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:51:30,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:51:30,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:51:30,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:51:30,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:30" (1/1) ... [2024-11-16 09:51:30,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:30" (1/1) ... [2024-11-16 09:51:30,332 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5289 [2024-11-16 09:51:30,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:51:30,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:51:30,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:51:30,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:51:30,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:30" (1/1) ... [2024-11-16 09:51:30,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:30" (1/1) ... [2024-11-16 09:51:30,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:30" (1/1) ... [2024-11-16 09:51:30,568 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-16 09:51:30,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:30" (1/1) ... [2024-11-16 09:51:30,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:30" (1/1) ... [2024-11-16 09:51:30,713 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:30" (1/1) ... [2024-11-16 09:51:30,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:30" (1/1) ... [2024-11-16 09:51:30,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:30" (1/1) ... [2024-11-16 09:51:30,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:30" (1/1) ... [2024-11-16 09:51:30,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:51:30,819 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:51:30,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:51:30,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:51:30,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:30" (1/1) ... [2024-11-16 09:51:30,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:51:30,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:51:30,850 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-16 09:51:30,852 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-16 09:51:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:51:30,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 09:51:30,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:51:30,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:51:31,018 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:51:31,020 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:51:34,271 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc calculate_output_#t~ret49#1; [2024-11-16 09:51:34,272 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3854: havoc calculate_output2_#t~ret50#1; [2024-11-16 09:51:34,272 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L5344: havoc calculate_output3_#t~ret51#1; [2024-11-16 09:51:34,448 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-11-16 09:51:34,449 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:51:34,480 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:51:34,480 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:51:34,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:51:34 BoogieIcfgContainer [2024-11-16 09:51:34,481 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:51:34,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:51:34,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:51:34,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:51:34,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:51:28" (1/3) ... [2024-11-16 09:51:34,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcf8f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:51:34, skipping insertion in model container [2024-11-16 09:51:34,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:30" (2/3) ... [2024-11-16 09:51:34,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcf8f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:51:34, skipping insertion in model container [2024-11-16 09:51:34,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:51:34" (3/3) ... [2024-11-16 09:51:34,489 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-16 09:51:34,502 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:51:34,502 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:51:34,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:51:34,587 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;@1f816f67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:51:34,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:51:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 956 states, 953 states have (on average 1.8961175236096537) internal successors, (1807), 955 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:34,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 09:51:34,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:34,603 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-16 09:51:34,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:34,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:34,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2009210598, now seen corresponding path program 1 times [2024-11-16 09:51:34,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:34,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549091544] [2024-11-16 09:51:34,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:34,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:34,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-16 09:51:34,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:34,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549091544] [2024-11-16 09:51:34,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549091544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:34,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:34,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 09:51:34,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081407711] [2024-11-16 09:51:34,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:34,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 09:51:34,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:34,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 09:51:34,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:51:34,931 INFO L87 Difference]: Start difference. First operand has 956 states, 953 states have (on average 1.8961175236096537) internal successors, (1807), 955 states have internal predecessors, (1807), 0 states have call successors, (0), 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-16 09:51:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:34,999 INFO L93 Difference]: Finished difference Result 1841 states and 3480 transitions. [2024-11-16 09:51:35,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 09:51:35,002 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-16 09:51:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:35,017 INFO L225 Difference]: With dead ends: 1841 [2024-11-16 09:51:35,018 INFO L226 Difference]: Without dead ends: 888 [2024-11-16 09:51:35,022 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-16 09:51:35,030 INFO L432 NwaCegarLoop]: 1736 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, 1736 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-16 09:51:35,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-11-16 09:51:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2024-11-16 09:51:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 886 states have (on average 1.8871331828442437) internal successors, (1672), 887 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1672 transitions. [2024-11-16 09:51:35,099 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1672 transitions. Word has length 32 [2024-11-16 09:51:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:35,099 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1672 transitions. [2024-11-16 09:51:35,099 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-16 09:51:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1672 transitions. [2024-11-16 09:51:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 09:51:35,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:35,101 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-16 09:51:35,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 09:51:35,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:35,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:35,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1978190791, now seen corresponding path program 1 times [2024-11-16 09:51:35,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:35,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855293830] [2024-11-16 09:51:35,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:35,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:35,365 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-16 09:51:35,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:35,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855293830] [2024-11-16 09:51:35,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855293830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:35,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:35,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:51:35,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750593519] [2024-11-16 09:51:35,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:35,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:51:35,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:35,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:51:35,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:51:35,369 INFO L87 Difference]: Start difference. First operand 888 states and 1672 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-16 09:51:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:35,503 INFO L93 Difference]: Finished difference Result 957 states and 1779 transitions. [2024-11-16 09:51:35,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:51:35,503 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-16 09:51:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:35,507 INFO L225 Difference]: With dead ends: 957 [2024-11-16 09:51:35,507 INFO L226 Difference]: Without dead ends: 888 [2024-11-16 09:51:35,508 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-16 09:51:35,509 INFO L432 NwaCegarLoop]: 1670 mSDtfsCounter, 0 mSDsluCounter, 4944 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6614 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.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:35,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6614 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:51:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-11-16 09:51:35,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2024-11-16 09:51:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 886 states have (on average 1.8182844243792324) internal successors, (1611), 887 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1611 transitions. [2024-11-16 09:51:35,530 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1611 transitions. Word has length 32 [2024-11-16 09:51:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:35,530 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1611 transitions. [2024-11-16 09:51:35,531 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-16 09:51:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1611 transitions. [2024-11-16 09:51:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-16 09:51:35,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:35,534 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-16 09:51:35,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 09:51:35,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:35,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:35,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1561697513, now seen corresponding path program 1 times [2024-11-16 09:51:35,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:35,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260201622] [2024-11-16 09:51:35,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:35,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:35,790 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-16 09:51:35,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:35,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260201622] [2024-11-16 09:51:35,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260201622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:35,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:35,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:35,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530331336] [2024-11-16 09:51:35,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:35,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 09:51:35,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:35,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 09:51:35,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 09:51:35,795 INFO L87 Difference]: Start difference. First operand 888 states and 1611 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-16 09:51:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:40,626 INFO L93 Difference]: Finished difference Result 3147 states and 5924 transitions. [2024-11-16 09:51:40,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 09:51:40,628 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-16 09:51:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:40,634 INFO L225 Difference]: With dead ends: 3147 [2024-11-16 09:51:40,635 INFO L226 Difference]: Without dead ends: 2392 [2024-11-16 09:51:40,635 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-16 09:51:40,636 INFO L432 NwaCegarLoop]: 847 mSDtfsCounter, 2521 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2521 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:40,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2521 Valid, 870 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-16 09:51:40,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2024-11-16 09:51:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2392. [2024-11-16 09:51:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 2390 states have (on average 1.5594142259414225) internal successors, (3727), 2391 states have internal predecessors, (3727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:40,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3727 transitions. [2024-11-16 09:51:40,672 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3727 transitions. Word has length 69 [2024-11-16 09:51:40,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:40,672 INFO L471 AbstractCegarLoop]: Abstraction has 2392 states and 3727 transitions. [2024-11-16 09:51:40,672 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-16 09:51:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3727 transitions. [2024-11-16 09:51:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-16 09:51:40,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:40,677 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-16 09:51:40,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 09:51:40,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:40,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:40,678 INFO L85 PathProgramCache]: Analyzing trace with hash -760950915, now seen corresponding path program 1 times [2024-11-16 09:51:40,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:40,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349540840] [2024-11-16 09:51:40,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:40,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:40,944 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-16 09:51:40,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:40,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349540840] [2024-11-16 09:51:40,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349540840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:40,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:40,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:51:40,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278147414] [2024-11-16 09:51:40,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:40,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:51:40,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:40,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:51:40,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:51:40,946 INFO L87 Difference]: Start difference. First operand 2392 states and 3727 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-16 09:51:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:41,351 INFO L93 Difference]: Finished difference Result 3432 states and 5375 transitions. [2024-11-16 09:51:41,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 09:51:41,352 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-16 09:51:41,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:41,365 INFO L225 Difference]: With dead ends: 3432 [2024-11-16 09:51:41,365 INFO L226 Difference]: Without dead ends: 3367 [2024-11-16 09:51:41,368 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-16 09:51:41,369 INFO L432 NwaCegarLoop]: 1605 mSDtfsCounter, 13562 mSDsluCounter, 4183 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13562 SdHoareTripleChecker+Valid, 5788 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-16 09:51:41,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13562 Valid, 5788 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 09:51:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2024-11-16 09:51:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 2454. [2024-11-16 09:51:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2454 states, 2452 states have (on average 1.5603588907014683) internal successors, (3826), 2453 states have internal predecessors, (3826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 3826 transitions. [2024-11-16 09:51:41,415 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 3826 transitions. Word has length 92 [2024-11-16 09:51:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:41,416 INFO L471 AbstractCegarLoop]: Abstraction has 2454 states and 3826 transitions. [2024-11-16 09:51:41,416 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-16 09:51:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 3826 transitions. [2024-11-16 09:51:41,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 09:51:41,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:41,419 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-16 09:51:41,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 09:51:41,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:41,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:41,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1159971551, now seen corresponding path program 1 times [2024-11-16 09:51:41,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:41,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403009307] [2024-11-16 09:51:41,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:41,803 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-16 09:51:41,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403009307] [2024-11-16 09:51:41,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403009307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:41,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:41,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:51:41,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340872155] [2024-11-16 09:51:41,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:41,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:51:41,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:41,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:51:41,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:51:41,808 INFO L87 Difference]: Start difference. First operand 2454 states and 3826 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-16 09:51:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:42,213 INFO L93 Difference]: Finished difference Result 2584 states and 4030 transitions. [2024-11-16 09:51:42,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:51:42,213 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-16 09:51:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:42,223 INFO L225 Difference]: With dead ends: 2584 [2024-11-16 09:51:42,223 INFO L226 Difference]: Without dead ends: 2457 [2024-11-16 09:51:42,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-16 09:51:42,225 INFO L432 NwaCegarLoop]: 1601 mSDtfsCounter, 10675 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10675 SdHoareTripleChecker+Valid, 2307 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-16 09:51:42,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10675 Valid, 2307 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:51:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2024-11-16 09:51:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2454. [2024-11-16 09:51:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2454 states, 2452 states have (on average 1.5599510603588906) internal successors, (3825), 2453 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 3825 transitions. [2024-11-16 09:51:42,264 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 3825 transitions. Word has length 94 [2024-11-16 09:51:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:42,264 INFO L471 AbstractCegarLoop]: Abstraction has 2454 states and 3825 transitions. [2024-11-16 09:51:42,264 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-16 09:51:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 3825 transitions. [2024-11-16 09:51:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-16 09:51:42,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:42,265 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-16 09:51:42,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 09:51:42,266 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:42,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:42,266 INFO L85 PathProgramCache]: Analyzing trace with hash -971768378, now seen corresponding path program 1 times [2024-11-16 09:51:42,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:42,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861602291] [2024-11-16 09:51:42,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:42,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:42,367 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-16 09:51:42,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:42,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861602291] [2024-11-16 09:51:42,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861602291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:42,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:42,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:42,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558069605] [2024-11-16 09:51:42,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:42,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:42,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:42,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:42,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:42,370 INFO L87 Difference]: Start difference. First operand 2454 states and 3825 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-16 09:51:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:42,406 INFO L93 Difference]: Finished difference Result 2696 states and 4207 transitions. [2024-11-16 09:51:42,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:42,406 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-16 09:51:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:42,413 INFO L225 Difference]: With dead ends: 2696 [2024-11-16 09:51:42,413 INFO L226 Difference]: Without dead ends: 2569 [2024-11-16 09:51:42,414 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-16 09:51:42,415 INFO L432 NwaCegarLoop]: 1607 mSDtfsCounter, 1512 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1703 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-16 09:51:42,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1703 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2024-11-16 09:51:42,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2564. [2024-11-16 09:51:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2562 states have (on average 1.5601092896174864) internal successors, (3997), 2563 states have internal predecessors, (3997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3997 transitions. [2024-11-16 09:51:42,454 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3997 transitions. Word has length 95 [2024-11-16 09:51:42,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:42,455 INFO L471 AbstractCegarLoop]: Abstraction has 2564 states and 3997 transitions. [2024-11-16 09:51:42,455 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-16 09:51:42,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3997 transitions. [2024-11-16 09:51:42,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:42,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:42,457 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-16 09:51:42,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 09:51:42,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:42,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:42,458 INFO L85 PathProgramCache]: Analyzing trace with hash 45305697, now seen corresponding path program 1 times [2024-11-16 09:51:42,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:42,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278045592] [2024-11-16 09:51:42,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:42,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:42,525 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-16 09:51:42,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:42,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278045592] [2024-11-16 09:51:42,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278045592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:42,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:42,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:42,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722921618] [2024-11-16 09:51:42,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:42,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:42,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:42,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:42,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:42,528 INFO L87 Difference]: Start difference. First operand 2564 states and 3997 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-16 09:51:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:42,563 INFO L93 Difference]: Finished difference Result 3022 states and 4715 transitions. [2024-11-16 09:51:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:42,564 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-16 09:51:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:42,572 INFO L225 Difference]: With dead ends: 3022 [2024-11-16 09:51:42,572 INFO L226 Difference]: Without dead ends: 2785 [2024-11-16 09:51:42,573 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-16 09:51:42,574 INFO L432 NwaCegarLoop]: 1690 mSDtfsCounter, 1531 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 1798 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-16 09:51:42,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 1798 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2024-11-16 09:51:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 2782. [2024-11-16 09:51:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2780 states have (on average 1.5597122302158273) internal successors, (4336), 2781 states have internal predecessors, (4336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 4336 transitions. [2024-11-16 09:51:42,618 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 4336 transitions. Word has length 96 [2024-11-16 09:51:42,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:42,619 INFO L471 AbstractCegarLoop]: Abstraction has 2782 states and 4336 transitions. [2024-11-16 09:51:42,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-16 09:51:42,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 4336 transitions. [2024-11-16 09:51:42,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:42,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:42,620 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-16 09:51:42,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 09:51:42,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:42,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1153405601, now seen corresponding path program 1 times [2024-11-16 09:51:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:42,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625432166] [2024-11-16 09:51:42,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:42,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:42,685 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-16 09:51:42,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:42,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625432166] [2024-11-16 09:51:42,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625432166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:42,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:42,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:42,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820398902] [2024-11-16 09:51:42,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:42,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:42,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:42,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:42,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:42,687 INFO L87 Difference]: Start difference. First operand 2782 states and 4336 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-16 09:51:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:42,721 INFO L93 Difference]: Finished difference Result 3660 states and 5704 transitions. [2024-11-16 09:51:42,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:42,722 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-16 09:51:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:42,730 INFO L225 Difference]: With dead ends: 3660 [2024-11-16 09:51:42,731 INFO L226 Difference]: Without dead ends: 3205 [2024-11-16 09:51:42,732 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-16 09:51:42,733 INFO L432 NwaCegarLoop]: 1688 mSDtfsCounter, 1529 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 1800 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-16 09:51:42,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1529 Valid, 1800 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:42,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2024-11-16 09:51:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 3202. [2024-11-16 09:51:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3202 states, 3200 states have (on average 1.556875) internal successors, (4982), 3201 states have internal predecessors, (4982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 4982 transitions. [2024-11-16 09:51:42,788 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 4982 transitions. Word has length 96 [2024-11-16 09:51:42,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:42,788 INFO L471 AbstractCegarLoop]: Abstraction has 3202 states and 4982 transitions. [2024-11-16 09:51:42,788 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-16 09:51:42,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 4982 transitions. [2024-11-16 09:51:42,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:42,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:42,789 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-16 09:51:42,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 09:51:42,790 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:42,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:42,790 INFO L85 PathProgramCache]: Analyzing trace with hash 380864801, now seen corresponding path program 1 times [2024-11-16 09:51:42,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:42,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820542811] [2024-11-16 09:51:42,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:42,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:42,869 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-16 09:51:42,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:42,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820542811] [2024-11-16 09:51:42,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820542811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:42,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:42,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:42,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096357531] [2024-11-16 09:51:42,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:42,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:42,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:42,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:42,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:42,873 INFO L87 Difference]: Start difference. First operand 3202 states and 4982 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-16 09:51:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:42,912 INFO L93 Difference]: Finished difference Result 4888 states and 7586 transitions. [2024-11-16 09:51:42,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:42,912 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-16 09:51:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:42,925 INFO L225 Difference]: With dead ends: 4888 [2024-11-16 09:51:42,925 INFO L226 Difference]: Without dead ends: 4013 [2024-11-16 09:51:42,928 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-16 09:51:42,928 INFO L432 NwaCegarLoop]: 1676 mSDtfsCounter, 1525 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1796 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-16 09:51:42,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1796 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2024-11-16 09:51:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 4010. [2024-11-16 09:51:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4010 states, 4008 states have (on average 1.5494011976047903) internal successors, (6210), 4009 states have internal predecessors, (6210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 6210 transitions. [2024-11-16 09:51:43,003 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 6210 transitions. Word has length 96 [2024-11-16 09:51:43,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:43,004 INFO L471 AbstractCegarLoop]: Abstraction has 4010 states and 6210 transitions. [2024-11-16 09:51:43,004 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-16 09:51:43,004 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 6210 transitions. [2024-11-16 09:51:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:43,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:43,006 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-16 09:51:43,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 09:51:43,006 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:43,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:43,006 INFO L85 PathProgramCache]: Analyzing trace with hash -620544927, now seen corresponding path program 1 times [2024-11-16 09:51:43,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:43,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303637189] [2024-11-16 09:51:43,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:43,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:43,070 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-16 09:51:43,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:43,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303637189] [2024-11-16 09:51:43,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303637189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:43,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:43,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:43,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812388158] [2024-11-16 09:51:43,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:43,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:43,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:43,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:43,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:43,072 INFO L87 Difference]: Start difference. First operand 4010 states and 6210 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-16 09:51:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:43,124 INFO L93 Difference]: Finished difference Result 7248 states and 11158 transitions. [2024-11-16 09:51:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:43,125 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-16 09:51:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:43,175 INFO L225 Difference]: With dead ends: 7248 [2024-11-16 09:51:43,176 INFO L226 Difference]: Without dead ends: 5565 [2024-11-16 09:51:43,178 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-16 09:51:43,178 INFO L432 NwaCegarLoop]: 1674 mSDtfsCounter, 1523 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1798 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-16 09:51:43,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1798 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5565 states. [2024-11-16 09:51:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5565 to 5562. [2024-11-16 09:51:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5562 states, 5560 states have (on average 1.5356115107913668) internal successors, (8538), 5561 states have internal predecessors, (8538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5562 states to 5562 states and 8538 transitions. [2024-11-16 09:51:43,309 INFO L78 Accepts]: Start accepts. Automaton has 5562 states and 8538 transitions. Word has length 96 [2024-11-16 09:51:43,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:43,310 INFO L471 AbstractCegarLoop]: Abstraction has 5562 states and 8538 transitions. [2024-11-16 09:51:43,310 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-16 09:51:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5562 states and 8538 transitions. [2024-11-16 09:51:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:43,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:43,311 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-16 09:51:43,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 09:51:43,311 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:43,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash -634994783, now seen corresponding path program 1 times [2024-11-16 09:51:43,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:43,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117216785] [2024-11-16 09:51:43,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:43,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:43,396 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-16 09:51:43,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:43,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117216785] [2024-11-16 09:51:43,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117216785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:43,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:43,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:43,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321294000] [2024-11-16 09:51:43,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:43,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:43,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:43,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:43,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:43,398 INFO L87 Difference]: Start difference. First operand 5562 states and 8538 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-16 09:51:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:43,526 INFO L93 Difference]: Finished difference Result 11776 states and 17918 transitions. [2024-11-16 09:51:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:43,527 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-16 09:51:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:43,544 INFO L225 Difference]: With dead ends: 11776 [2024-11-16 09:51:43,544 INFO L226 Difference]: Without dead ends: 8541 [2024-11-16 09:51:43,549 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-16 09:51:43,550 INFO L432 NwaCegarLoop]: 1672 mSDtfsCounter, 1521 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1800 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-16 09:51:43,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1800 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8541 states. [2024-11-16 09:51:43,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8541 to 8538. [2024-11-16 09:51:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8538 states, 8536 states have (on average 1.5156982193064668) internal successors, (12938), 8537 states have internal predecessors, (12938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8538 states to 8538 states and 12938 transitions. [2024-11-16 09:51:43,731 INFO L78 Accepts]: Start accepts. Automaton has 8538 states and 12938 transitions. Word has length 96 [2024-11-16 09:51:43,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:43,731 INFO L471 AbstractCegarLoop]: Abstraction has 8538 states and 12938 transitions. [2024-11-16 09:51:43,732 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-16 09:51:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 8538 states and 12938 transitions. [2024-11-16 09:51:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:43,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:43,733 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-16 09:51:43,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 09:51:43,733 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:43,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:43,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1456607969, now seen corresponding path program 1 times [2024-11-16 09:51:43,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:43,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219236956] [2024-11-16 09:51:43,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:43,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:51:43,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:43,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219236956] [2024-11-16 09:51:43,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219236956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:43,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:43,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:43,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770271354] [2024-11-16 09:51:43,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:43,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:43,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:43,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:43,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:43,798 INFO L87 Difference]: Start difference. First operand 8538 states and 12938 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-16 09:51:43,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:43,930 INFO L93 Difference]: Finished difference Result 20448 states and 30670 transitions. [2024-11-16 09:51:43,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:43,930 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-16 09:51:43,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:43,951 INFO L225 Difference]: With dead ends: 20448 [2024-11-16 09:51:43,951 INFO L226 Difference]: Without dead ends: 14237 [2024-11-16 09:51:43,960 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-16 09:51:43,961 INFO L432 NwaCegarLoop]: 1670 mSDtfsCounter, 1519 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1802 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-16 09:51:43,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1802 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14237 states. [2024-11-16 09:51:44,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14237 to 14234. [2024-11-16 09:51:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14234 states, 14232 states have (on average 1.4914277684092188) internal successors, (21226), 14233 states have internal predecessors, (21226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 21226 transitions. [2024-11-16 09:51:44,262 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 21226 transitions. Word has length 96 [2024-11-16 09:51:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:44,263 INFO L471 AbstractCegarLoop]: Abstraction has 14234 states and 21226 transitions. [2024-11-16 09:51:44,263 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-16 09:51:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 21226 transitions. [2024-11-16 09:51:44,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:44,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:44,264 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-16 09:51:44,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 09:51:44,264 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:44,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:44,264 INFO L85 PathProgramCache]: Analyzing trace with hash 932330914, now seen corresponding path program 1 times [2024-11-16 09:51:44,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:44,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724796804] [2024-11-16 09:51:44,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:44,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:44,488 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-16 09:51:44,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:44,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724796804] [2024-11-16 09:51:44,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724796804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:44,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:44,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:51:44,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630467128] [2024-11-16 09:51:44,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:44,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:51:44,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:44,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:51:44,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:51:44,490 INFO L87 Difference]: Start difference. First operand 14234 states and 21226 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-16 09:51:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:44,646 INFO L93 Difference]: Finished difference Result 14621 states and 21740 transitions. [2024-11-16 09:51:44,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 09:51:44,647 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-16 09:51:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:44,668 INFO L225 Difference]: With dead ends: 14621 [2024-11-16 09:51:44,668 INFO L226 Difference]: Without dead ends: 14618 [2024-11-16 09:51:44,674 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-16 09:51:44,675 INFO L432 NwaCegarLoop]: 1605 mSDtfsCounter, 0 mSDsluCounter, 9617 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11222 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-16 09:51:44,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11222 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14618 states. [2024-11-16 09:51:45,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14618 to 14618. [2024-11-16 09:51:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14618 states, 14616 states have (on average 1.4741379310344827) internal successors, (21546), 14617 states have internal predecessors, (21546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14618 states to 14618 states and 21546 transitions. [2024-11-16 09:51:45,047 INFO L78 Accepts]: Start accepts. Automaton has 14618 states and 21546 transitions. Word has length 96 [2024-11-16 09:51:45,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:45,047 INFO L471 AbstractCegarLoop]: Abstraction has 14618 states and 21546 transitions. [2024-11-16 09:51:45,047 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-16 09:51:45,047 INFO L276 IsEmpty]: Start isEmpty. Operand 14618 states and 21546 transitions. [2024-11-16 09:51:45,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:45,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:45,048 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-16 09:51:45,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 09:51:45,049 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:45,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:45,049 INFO L85 PathProgramCache]: Analyzing trace with hash 662939105, now seen corresponding path program 1 times [2024-11-16 09:51:45,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:45,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081381696] [2024-11-16 09:51:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:45,121 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-16 09:51:45,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:45,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081381696] [2024-11-16 09:51:45,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081381696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:45,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:45,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:45,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584454857] [2024-11-16 09:51:45,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:45,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:45,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:45,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:45,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:45,123 INFO L87 Difference]: Start difference. First operand 14618 states and 21546 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-16 09:51:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:45,377 INFO L93 Difference]: Finished difference Result 38176 states and 55598 transitions. [2024-11-16 09:51:45,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:45,377 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-16 09:51:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:45,417 INFO L225 Difference]: With dead ends: 38176 [2024-11-16 09:51:45,418 INFO L226 Difference]: Without dead ends: 25885 [2024-11-16 09:51:45,438 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-16 09:51:45,439 INFO L432 NwaCegarLoop]: 1686 mSDtfsCounter, 1527 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1802 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-16 09:51:45,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1802 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25885 states. [2024-11-16 09:51:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25885 to 25882. [2024-11-16 09:51:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25882 states, 25880 states have (on average 1.4458268933539413) internal successors, (37418), 25881 states have internal predecessors, (37418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25882 states to 25882 states and 37418 transitions. [2024-11-16 09:51:45,967 INFO L78 Accepts]: Start accepts. Automaton has 25882 states and 37418 transitions. Word has length 96 [2024-11-16 09:51:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:45,967 INFO L471 AbstractCegarLoop]: Abstraction has 25882 states and 37418 transitions. [2024-11-16 09:51:45,967 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-16 09:51:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 25882 states and 37418 transitions. [2024-11-16 09:51:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 09:51:45,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:45,968 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-16 09:51:45,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 09:51:45,969 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:45,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash 373352353, now seen corresponding path program 1 times [2024-11-16 09:51:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514500559] [2024-11-16 09:51:45,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:46,030 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-16 09:51:46,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:46,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514500559] [2024-11-16 09:51:46,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514500559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:46,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:46,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:46,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285453531] [2024-11-16 09:51:46,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:46,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:46,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:46,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:46,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:46,033 INFO L87 Difference]: Start difference. First operand 25882 states and 37418 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-16 09:51:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:46,390 INFO L93 Difference]: Finished difference Result 50468 states and 73011 transitions. [2024-11-16 09:51:46,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:46,390 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-16 09:51:46,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:46,447 INFO L225 Difference]: With dead ends: 50468 [2024-11-16 09:51:46,447 INFO L226 Difference]: Without dead ends: 37408 [2024-11-16 09:51:46,469 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-16 09:51:46,470 INFO L432 NwaCegarLoop]: 1695 mSDtfsCounter, 1530 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 1799 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-16 09:51:46,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 1799 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:46,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37408 states. [2024-11-16 09:51:47,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37408 to 37405. [2024-11-16 09:51:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37405 states, 37403 states have (on average 1.435098788867203) internal successors, (53677), 37404 states have internal predecessors, (53677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37405 states to 37405 states and 53677 transitions. [2024-11-16 09:51:47,517 INFO L78 Accepts]: Start accepts. Automaton has 37405 states and 53677 transitions. Word has length 98 [2024-11-16 09:51:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:47,518 INFO L471 AbstractCegarLoop]: Abstraction has 37405 states and 53677 transitions. [2024-11-16 09:51:47,518 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-16 09:51:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 37405 states and 53677 transitions. [2024-11-16 09:51:47,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 09:51:47,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:47,525 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-16 09:51:47,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 09:51:47,526 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:47,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:47,526 INFO L85 PathProgramCache]: Analyzing trace with hash -80776029, now seen corresponding path program 1 times [2024-11-16 09:51:47,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:47,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023967223] [2024-11-16 09:51:47,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:47,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:47,748 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-16 09:51:47,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:47,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023967223] [2024-11-16 09:51:47,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023967223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:47,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:47,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:51:47,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579654057] [2024-11-16 09:51:47,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:47,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:51:47,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:47,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:51:47,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:51:47,750 INFO L87 Difference]: Start difference. First operand 37405 states and 53677 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-16 09:51:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:51,447 INFO L93 Difference]: Finished difference Result 325176 states and 463935 transitions. [2024-11-16 09:51:51,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:51:51,448 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-16 09:51:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:52,024 INFO L225 Difference]: With dead ends: 325176 [2024-11-16 09:51:52,024 INFO L226 Difference]: Without dead ends: 290101 [2024-11-16 09:51:52,111 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-16 09:51:52,111 INFO L432 NwaCegarLoop]: 1721 mSDtfsCounter, 11803 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11803 SdHoareTripleChecker+Valid, 5162 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.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:52,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11803 Valid, 5162 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:51:52,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290101 states. [2024-11-16 09:51:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290101 to 72477. [2024-11-16 09:51:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72477 states, 72475 states have (on average 1.425884787857882) internal successors, (103341), 72476 states have internal predecessors, (103341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72477 states to 72477 states and 103341 transitions. [2024-11-16 09:51:55,589 INFO L78 Accepts]: Start accepts. Automaton has 72477 states and 103341 transitions. Word has length 123 [2024-11-16 09:51:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:55,590 INFO L471 AbstractCegarLoop]: Abstraction has 72477 states and 103341 transitions. [2024-11-16 09:51:55,590 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-16 09:51:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 72477 states and 103341 transitions. [2024-11-16 09:51:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 09:51:55,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:55,598 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-16 09:51:55,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 09:51:55,599 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:55,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:55,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1027323875, now seen corresponding path program 1 times [2024-11-16 09:51:55,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:55,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210413460] [2024-11-16 09:51:55,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:55,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:55,881 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-16 09:51:55,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:55,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210413460] [2024-11-16 09:51:55,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210413460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:55,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:55,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:51:55,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459673117] [2024-11-16 09:51:55,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:55,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:51:55,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:55,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:51:55,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:51:55,883 INFO L87 Difference]: Start difference. First operand 72477 states and 103341 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-16 09:52:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:52:01,554 INFO L93 Difference]: Finished difference Result 360248 states and 513599 transitions. [2024-11-16 09:52:01,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:52:01,554 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-16 09:52:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:52:02,194 INFO L225 Difference]: With dead ends: 360248 [2024-11-16 09:52:02,194 INFO L226 Difference]: Without dead ends: 325173 [2024-11-16 09:52:02,246 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-16 09:52:02,247 INFO L432 NwaCegarLoop]: 1717 mSDtfsCounter, 11858 mSDsluCounter, 3223 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11858 SdHoareTripleChecker+Valid, 4940 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.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:52:02,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11858 Valid, 4940 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:52:02,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325173 states. [2024-11-16 09:52:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325173 to 125213. [2024-11-16 09:52:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125213 states, 125211 states have (on average 1.418253987269489) internal successors, (177581), 125212 states have internal predecessors, (177581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125213 states to 125213 states and 177581 transitions. [2024-11-16 09:52:06,822 INFO L78 Accepts]: Start accepts. Automaton has 125213 states and 177581 transitions. Word has length 123 [2024-11-16 09:52:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:52:06,823 INFO L471 AbstractCegarLoop]: Abstraction has 125213 states and 177581 transitions. [2024-11-16 09:52:06,823 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-16 09:52:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 125213 states and 177581 transitions. [2024-11-16 09:52:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 09:52:06,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:52:06,831 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-16 09:52:06,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 09:52:06,832 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:52:06,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:52:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash 254783075, now seen corresponding path program 1 times [2024-11-16 09:52:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:52:06,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960441241] [2024-11-16 09:52:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:52:06,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:52:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:52:07,036 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-16 09:52:07,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:52:07,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960441241] [2024-11-16 09:52:07,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960441241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:52:07,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:52:07,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:52:07,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561549944] [2024-11-16 09:52:07,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:52:07,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:52:07,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:52:07,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:52:07,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:52:07,039 INFO L87 Difference]: Start difference. First operand 125213 states and 177581 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-16 09:52:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:52:14,292 INFO L93 Difference]: Finished difference Result 395320 states and 563263 transitions. [2024-11-16 09:52:14,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:52:14,292 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-16 09:52:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:52:14,822 INFO L225 Difference]: With dead ends: 395320 [2024-11-16 09:52:14,823 INFO L226 Difference]: Without dead ends: 360245 [2024-11-16 09:52:14,904 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-16 09:52:14,905 INFO L432 NwaCegarLoop]: 1713 mSDtfsCounter, 11935 mSDsluCounter, 3217 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11935 SdHoareTripleChecker+Valid, 4930 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-16 09:52:14,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11935 Valid, 4930 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:52:15,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360245 states.