./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label59.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 51dcd89c10622c543bf9ef783ec22401c3170140113dd2b2907b165950bd75af --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:30:13,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:30:13,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:30:13,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:30:13,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:30:13,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:30:13,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:30:13,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:30:13,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:30:13,927 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:30:13,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:30:13,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:30:13,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:30:13,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:30:13,928 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:30:13,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:30:13,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:30:13,930 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:30:13,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:30:13,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:30:13,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:30:13,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:30:13,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:30:13,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:30:13,932 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:30:13,932 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:30:13,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:30:13,933 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:30:13,933 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:30:13,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:30:13,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:30:13,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:30:13,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:30:13,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:30:13,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:30:13,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:30:13,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:30:13,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:30:13,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:30:13,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:30:13,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:30:13,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:30:13,937 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 -> 51dcd89c10622c543bf9ef783ec22401c3170140113dd2b2907b165950bd75af [2024-11-09 19:30:14,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:30:14,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:30:14,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:30:14,207 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:30:14,207 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:30:14,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label59.c [2024-11-09 19:30:15,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:30:15,910 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:30:15,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label59.c [2024-11-09 19:30:15,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4cacca2b/333cddff28d3473897d77bf0d80e4e3c/FLAG70a8e5c66 [2024-11-09 19:30:15,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4cacca2b/333cddff28d3473897d77bf0d80e4e3c [2024-11-09 19:30:15,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:30:15,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:30:15,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:30:15,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:30:15,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:30:15,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:30:15" (1/1) ... [2024-11-09 19:30:15,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8f0ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:15, skipping insertion in model container [2024-11-09 19:30:15,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:30:15" (1/1) ... [2024-11-09 19:30:16,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:30:16,257 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/eca-rers2012/Problem12_label59.c[5577,5590] [2024-11-09 19:30:16,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:30:16,836 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:30:16,856 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/eca-rers2012/Problem12_label59.c[5577,5590] [2024-11-09 19:30:17,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:30:17,194 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:30:17,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:17 WrapperNode [2024-11-09 19:30:17,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:30:17,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:30:17,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:30:17,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:30:17,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:17" (1/1) ... [2024-11-09 19:30:17,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:17" (1/1) ... [2024-11-09 19:30:17,516 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4760 [2024-11-09 19:30:17,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:30:17,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:30:17,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:30:17,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:30:17,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:17" (1/1) ... [2024-11-09 19:30:17,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:17" (1/1) ... [2024-11-09 19:30:17,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:17" (1/1) ... [2024-11-09 19:30:17,663 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-09 19:30:17,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:17" (1/1) ... [2024-11-09 19:30:17,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:17" (1/1) ... [2024-11-09 19:30:17,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:17" (1/1) ... [2024-11-09 19:30:17,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:17" (1/1) ... [2024-11-09 19:30:17,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:17" (1/1) ... [2024-11-09 19:30:17,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:17" (1/1) ... [2024-11-09 19:30:17,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:30:17,881 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:30:17,881 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:30:17,882 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:30:17,882 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:17" (1/1) ... [2024-11-09 19:30:17,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:30:17,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:30:17,940 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-09 19:30:17,958 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-09 19:30:18,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:30:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:30:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:30:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:30:18,132 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:30:18,134 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:30:22,509 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:30:22,510 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2024-11-09 19:30:22,510 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:30:22,734 INFO L? ?]: Removed 2039 outVars from TransFormulas that were not future-live. [2024-11-09 19:30:22,734 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:30:22,773 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:30:22,773 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:30:22,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:30:22 BoogieIcfgContainer [2024-11-09 19:30:22,774 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:30:22,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:30:22,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:30:22,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:30:22,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:30:15" (1/3) ... [2024-11-09 19:30:22,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67574168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:30:22, skipping insertion in model container [2024-11-09 19:30:22,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:17" (2/3) ... [2024-11-09 19:30:22,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67574168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:30:22, skipping insertion in model container [2024-11-09 19:30:22,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:30:22" (3/3) ... [2024-11-09 19:30:22,783 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label59.c [2024-11-09 19:30:22,797 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:30:22,798 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:30:22,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:30:22,882 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;@2e484f9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:30:22,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:30:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:22,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 19:30:22,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:22,895 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] [2024-11-09 19:30:22,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:22,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:22,899 INFO L85 PathProgramCache]: Analyzing trace with hash 885338623, now seen corresponding path program 1 times [2024-11-09 19:30:22,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:22,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871123002] [2024-11-09 19:30:22,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:22,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:23,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:23,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871123002] [2024-11-09 19:30:23,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871123002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:23,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:23,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:30:23,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850535229] [2024-11-09 19:30:23,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:23,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:23,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:23,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:23,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:23,256 INFO L87 Difference]: Start difference. First operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 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 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:27,166 INFO L93 Difference]: Finished difference Result 2394 states and 6675 transitions. [2024-11-09 19:30:27,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:27,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-11-09 19:30:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:27,198 INFO L225 Difference]: With dead ends: 2394 [2024-11-09 19:30:27,198 INFO L226 Difference]: Without dead ends: 1509 [2024-11-09 19:30:27,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 19:30:27,205 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1472 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3860 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 4624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 3860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:27,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 116 Invalid, 4624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 3860 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 19:30:27,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2024-11-09 19:30:27,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2024-11-09 19:30:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 2.7659151193633953) internal successors, (4171), 1508 states have internal predecessors, (4171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 4171 transitions. [2024-11-09 19:30:27,318 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 4171 transitions. Word has length 46 [2024-11-09 19:30:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:27,318 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 4171 transitions. [2024-11-09 19:30:27,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 4171 transitions. [2024-11-09 19:30:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 19:30:27,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:27,323 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:27,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:30:27,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:27,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:27,325 INFO L85 PathProgramCache]: Analyzing trace with hash -439750609, now seen corresponding path program 1 times [2024-11-09 19:30:27,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:27,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486408610] [2024-11-09 19:30:27,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:27,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:27,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:27,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486408610] [2024-11-09 19:30:27,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486408610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:27,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:27,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:30:27,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312265708] [2024-11-09 19:30:27,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:27,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:27,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:27,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:27,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:27,598 INFO L87 Difference]: Start difference. First operand 1509 states and 4171 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:31,500 INFO L93 Difference]: Finished difference Result 4523 states and 12509 transitions. [2024-11-09 19:30:31,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:31,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-11-09 19:30:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:31,512 INFO L225 Difference]: With dead ends: 4523 [2024-11-09 19:30:31,513 INFO L226 Difference]: Without dead ends: 3016 [2024-11-09 19:30:31,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 19:30:31,516 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 1417 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3622 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 4273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 3622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:31,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 478 Invalid, 4273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 3622 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 19:30:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2024-11-09 19:30:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3013. [2024-11-09 19:30:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 2.4794156706507304) internal successors, (7468), 3012 states have internal predecessors, (7468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 7468 transitions. [2024-11-09 19:30:31,581 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 7468 transitions. Word has length 112 [2024-11-09 19:30:31,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:31,582 INFO L471 AbstractCegarLoop]: Abstraction has 3013 states and 7468 transitions. [2024-11-09 19:30:31,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 7468 transitions. [2024-11-09 19:30:31,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 19:30:31,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:31,586 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:31,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:30:31,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:31,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:31,587 INFO L85 PathProgramCache]: Analyzing trace with hash -366615061, now seen corresponding path program 1 times [2024-11-09 19:30:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:31,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516570195] [2024-11-09 19:30:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:31,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:31,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:31,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516570195] [2024-11-09 19:30:31,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516570195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:31,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:31,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:31,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129575076] [2024-11-09 19:30:31,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:31,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:30:31,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:31,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:30:31,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:30:31,858 INFO L87 Difference]: Start difference. First operand 3013 states and 7468 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 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-09 19:30:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:36,873 INFO L93 Difference]: Finished difference Result 9784 states and 24034 transitions. [2024-11-09 19:30:36,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:30:36,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 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 113 [2024-11-09 19:30:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:36,893 INFO L225 Difference]: With dead ends: 9784 [2024-11-09 19:30:36,895 INFO L226 Difference]: Without dead ends: 6773 [2024-11-09 19:30:36,898 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-09 19:30:36,900 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 4316 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7419 mSolverCounterSat, 831 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4316 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 8250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 831 IncrementalHoareTripleChecker+Valid, 7419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:36,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4316 Valid, 410 Invalid, 8250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [831 Valid, 7419 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-09 19:30:36,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2024-11-09 19:30:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6773. [2024-11-09 19:30:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6773 states, 6772 states have (on average 2.340224453632605) internal successors, (15848), 6772 states have internal predecessors, (15848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6773 states to 6773 states and 15848 transitions. [2024-11-09 19:30:37,011 INFO L78 Accepts]: Start accepts. Automaton has 6773 states and 15848 transitions. Word has length 113 [2024-11-09 19:30:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:37,013 INFO L471 AbstractCegarLoop]: Abstraction has 6773 states and 15848 transitions. [2024-11-09 19:30:37,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 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-09 19:30:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 6773 states and 15848 transitions. [2024-11-09 19:30:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 19:30:37,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:37,015 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:37,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:30:37,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:37,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1797081763, now seen corresponding path program 1 times [2024-11-09 19:30:37,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:37,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980400877] [2024-11-09 19:30:37,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:37,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:37,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:37,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980400877] [2024-11-09 19:30:37,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980400877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:37,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:37,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:37,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609219106] [2024-11-09 19:30:37,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:37,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:30:37,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:37,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:30:37,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:30:37,250 INFO L87 Difference]: Start difference. First operand 6773 states and 15848 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:40,663 INFO L93 Difference]: Finished difference Result 16593 states and 38214 transitions. [2024-11-09 19:30:40,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:30:40,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-11-09 19:30:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:40,697 INFO L225 Difference]: With dead ends: 16593 [2024-11-09 19:30:40,697 INFO L226 Difference]: Without dead ends: 9784 [2024-11-09 19:30:40,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:30:40,707 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 1386 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5149 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 5421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 5149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:40,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 717 Invalid, 5421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 5149 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 19:30:40,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9784 states. [2024-11-09 19:30:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9784 to 9781. [2024-11-09 19:30:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9781 states, 9780 states have (on average 2.219836400817996) internal successors, (21710), 9780 states have internal predecessors, (21710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9781 states to 9781 states and 21710 transitions. [2024-11-09 19:30:40,861 INFO L78 Accepts]: Start accepts. Automaton has 9781 states and 21710 transitions. Word has length 118 [2024-11-09 19:30:40,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:40,861 INFO L471 AbstractCegarLoop]: Abstraction has 9781 states and 21710 transitions. [2024-11-09 19:30:40,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:40,862 INFO L276 IsEmpty]: Start isEmpty. Operand 9781 states and 21710 transitions. [2024-11-09 19:30:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-09 19:30:40,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:40,865 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:40,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:30:40,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:40,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:40,866 INFO L85 PathProgramCache]: Analyzing trace with hash -751872705, now seen corresponding path program 1 times [2024-11-09 19:30:40,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:40,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572450595] [2024-11-09 19:30:40,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:40,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:41,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:41,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572450595] [2024-11-09 19:30:41,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572450595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:41,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:41,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:41,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598171488] [2024-11-09 19:30:41,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:41,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:41,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:41,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:41,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:41,133 INFO L87 Difference]: Start difference. First operand 9781 states and 21710 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:44,512 INFO L93 Difference]: Finished difference Result 22568 states and 51218 transitions. [2024-11-09 19:30:44,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:44,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 192 [2024-11-09 19:30:44,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:44,535 INFO L225 Difference]: With dead ends: 22568 [2024-11-09 19:30:44,535 INFO L226 Difference]: Without dead ends: 12789 [2024-11-09 19:30:44,544 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-09 19:30:44,546 INFO L432 NwaCegarLoop]: 2080 mSDtfsCounter, 1414 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3834 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 4320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 3834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:44,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 2090 Invalid, 4320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 3834 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-09 19:30:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12789 states. [2024-11-09 19:30:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12789 to 12789. [2024-11-09 19:30:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12789 states, 12788 states have (on average 2.2044103847356897) internal successors, (28190), 12788 states have internal predecessors, (28190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12789 states to 12789 states and 28190 transitions. [2024-11-09 19:30:44,736 INFO L78 Accepts]: Start accepts. Automaton has 12789 states and 28190 transitions. Word has length 192 [2024-11-09 19:30:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:44,736 INFO L471 AbstractCegarLoop]: Abstraction has 12789 states and 28190 transitions. [2024-11-09 19:30:44,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 12789 states and 28190 transitions. [2024-11-09 19:30:44,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-09 19:30:44,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:44,739 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:30:44,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:30:44,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:44,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:44,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1395976965, now seen corresponding path program 1 times [2024-11-09 19:30:44,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:44,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954476498] [2024-11-09 19:30:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:44,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 8 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-09 19:30:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954476498] [2024-11-09 19:30:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954476498] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:30:45,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422971935] [2024-11-09 19:30:45,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:45,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:30:45,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:30:45,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:30:45,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:30:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:45,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:30:45,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:30:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:45,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:30:45,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422971935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:45,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:30:45,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-09 19:30:45,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937499042] [2024-11-09 19:30:45,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:45,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:45,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:45,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:45,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:30:45,279 INFO L87 Difference]: Start difference. First operand 12789 states and 28190 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:48,257 INFO L93 Difference]: Finished difference Result 34600 states and 77110 transitions. [2024-11-09 19:30:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:48,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2024-11-09 19:30:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:48,294 INFO L225 Difference]: With dead ends: 34600 [2024-11-09 19:30:48,294 INFO L226 Difference]: Without dead ends: 21813 [2024-11-09 19:30:48,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:30:48,308 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1606 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3432 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 4135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 3432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:48,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 312 Invalid, 4135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 3432 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 19:30:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21813 states. [2024-11-09 19:30:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21813 to 21813. [2024-11-09 19:30:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21813 states, 21812 states have (on average 2.170364936732074) internal successors, (47340), 21812 states have internal predecessors, (47340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:48,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21813 states to 21813 states and 47340 transitions. [2024-11-09 19:30:48,646 INFO L78 Accepts]: Start accepts. Automaton has 21813 states and 47340 transitions. Word has length 254 [2024-11-09 19:30:48,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:48,647 INFO L471 AbstractCegarLoop]: Abstraction has 21813 states and 47340 transitions. [2024-11-09 19:30:48,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:48,647 INFO L276 IsEmpty]: Start isEmpty. Operand 21813 states and 47340 transitions. [2024-11-09 19:30:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-09 19:30:48,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:48,650 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:30:48,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:30:48,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 19:30:48,851 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:48,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:48,851 INFO L85 PathProgramCache]: Analyzing trace with hash -554692311, now seen corresponding path program 1 times [2024-11-09 19:30:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:48,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809686384] [2024-11-09 19:30:48,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:48,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 19:30:49,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:49,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809686384] [2024-11-09 19:30:49,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809686384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:49,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:49,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:49,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327830074] [2024-11-09 19:30:49,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:49,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:30:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:49,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:30:49,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:30:49,105 INFO L87 Difference]: Start difference. First operand 21813 states and 47340 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:52,688 INFO L93 Difference]: Finished difference Result 52727 states and 113906 transitions. [2024-11-09 19:30:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:30:52,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 260 [2024-11-09 19:30:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:52,731 INFO L225 Difference]: With dead ends: 52727 [2024-11-09 19:30:52,732 INFO L226 Difference]: Without dead ends: 30840 [2024-11-09 19:30:52,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:30:52,748 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1456 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5757 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 6005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 5757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:52,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 331 Invalid, 6005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 5757 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 19:30:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30840 states. [2024-11-09 19:30:53,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30840 to 30837. [2024-11-09 19:30:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30837 states, 30836 states have (on average 2.1408418731352965) internal successors, (66015), 30836 states have internal predecessors, (66015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30837 states to 30837 states and 66015 transitions. [2024-11-09 19:30:53,072 INFO L78 Accepts]: Start accepts. Automaton has 30837 states and 66015 transitions. Word has length 260 [2024-11-09 19:30:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:53,072 INFO L471 AbstractCegarLoop]: Abstraction has 30837 states and 66015 transitions. [2024-11-09 19:30:53,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 30837 states and 66015 transitions. [2024-11-09 19:30:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-11-09 19:30:53,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:53,076 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:53,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:30:53,077 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:53,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:53,077 INFO L85 PathProgramCache]: Analyzing trace with hash 667822887, now seen corresponding path program 1 times [2024-11-09 19:30:53,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:53,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574051004] [2024-11-09 19:30:53,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:53,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-09 19:30:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:53,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574051004] [2024-11-09 19:30:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574051004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:53,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:53,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:30:53,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886978123] [2024-11-09 19:30:53,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:53,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:53,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:53,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:53,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:53,291 INFO L87 Difference]: Start difference. First operand 30837 states and 66015 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:56,573 INFO L93 Difference]: Finished difference Result 86488 states and 185815 transitions. [2024-11-09 19:30:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:56,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 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 282 [2024-11-09 19:30:56,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:56,658 INFO L225 Difference]: With dead ends: 86488 [2024-11-09 19:30:56,659 INFO L226 Difference]: Without dead ends: 55653 [2024-11-09 19:30:56,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 19:30:56,688 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 1340 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3349 mSolverCounterSat, 825 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 4174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 825 IncrementalHoareTripleChecker+Valid, 3349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:56,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 498 Invalid, 4174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [825 Valid, 3349 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-09 19:30:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55653 states. [2024-11-09 19:30:57,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55653 to 45877. [2024-11-09 19:30:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45877 states, 45876 states have (on average 2.0875839218763623) internal successors, (95770), 45876 states have internal predecessors, (95770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45877 states to 45877 states and 95770 transitions. [2024-11-09 19:30:57,309 INFO L78 Accepts]: Start accepts. Automaton has 45877 states and 95770 transitions. Word has length 282 [2024-11-09 19:30:57,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:57,312 INFO L471 AbstractCegarLoop]: Abstraction has 45877 states and 95770 transitions. [2024-11-09 19:30:57,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 45877 states and 95770 transitions. [2024-11-09 19:30:57,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-11-09 19:30:57,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:57,321 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:30:57,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:30:57,321 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:57,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1752652669, now seen corresponding path program 1 times [2024-11-09 19:30:57,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:57,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772292303] [2024-11-09 19:30:57,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:57,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-09 19:30:57,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772292303] [2024-11-09 19:30:57,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772292303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:57,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:57,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414169562] [2024-11-09 19:30:57,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:57,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:57,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:57,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:57,680 INFO L87 Difference]: Start difference. First operand 45877 states and 95770 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:01,131 INFO L93 Difference]: Finished difference Result 109800 states and 230555 transitions. [2024-11-09 19:31:01,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:01,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 385 [2024-11-09 19:31:01,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:01,239 INFO L225 Difference]: With dead ends: 109800 [2024-11-09 19:31:01,239 INFO L226 Difference]: Without dead ends: 63925 [2024-11-09 19:31:01,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-09 19:31:01,272 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1457 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3399 mSolverCounterSat, 1042 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 4441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1042 IncrementalHoareTripleChecker+Valid, 3399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:01,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 187 Invalid, 4441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1042 Valid, 3399 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-09 19:31:01,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63925 states. [2024-11-09 19:31:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63925 to 63925. [2024-11-09 19:31:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63925 states, 63924 states have (on average 2.0838652149427443) internal successors, (133209), 63924 states have internal predecessors, (133209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63925 states to 63925 states and 133209 transitions. [2024-11-09 19:31:02,407 INFO L78 Accepts]: Start accepts. Automaton has 63925 states and 133209 transitions. Word has length 385 [2024-11-09 19:31:02,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:02,408 INFO L471 AbstractCegarLoop]: Abstraction has 63925 states and 133209 transitions. [2024-11-09 19:31:02,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 63925 states and 133209 transitions. [2024-11-09 19:31:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2024-11-09 19:31:02,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:02,416 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:31:02,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:31:02,416 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:02,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:02,417 INFO L85 PathProgramCache]: Analyzing trace with hash 891153889, now seen corresponding path program 1 times [2024-11-09 19:31:02,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:02,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13361837] [2024-11-09 19:31:02,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:02,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-09 19:31:02,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:02,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13361837] [2024-11-09 19:31:02,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13361837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:02,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:31:02,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:31:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2693760] [2024-11-09 19:31:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:02,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:31:02,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:02,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:31:02,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:31:02,686 INFO L87 Difference]: Start difference. First operand 63925 states and 133209 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:06,601 INFO L93 Difference]: Finished difference Result 152664 states and 318216 transitions. [2024-11-09 19:31:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:06,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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 387 [2024-11-09 19:31:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:06,828 INFO L225 Difference]: With dead ends: 152664 [2024-11-09 19:31:06,828 INFO L226 Difference]: Without dead ends: 88741 [2024-11-09 19:31:06,870 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-09 19:31:06,870 INFO L432 NwaCegarLoop]: 1895 mSDtfsCounter, 1323 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3951 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 4280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 3951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:06,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 1905 Invalid, 4280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 3951 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 19:31:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88741 states. [2024-11-09 19:31:07,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88741 to 88741. [2024-11-09 19:31:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88741 states, 88740 states have (on average 2.0724250619788145) internal successors, (183907), 88740 states have internal predecessors, (183907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88741 states to 88741 states and 183907 transitions. [2024-11-09 19:31:08,269 INFO L78 Accepts]: Start accepts. Automaton has 88741 states and 183907 transitions. Word has length 387 [2024-11-09 19:31:08,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:08,272 INFO L471 AbstractCegarLoop]: Abstraction has 88741 states and 183907 transitions. [2024-11-09 19:31:08,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 88741 states and 183907 transitions. [2024-11-09 19:31:08,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2024-11-09 19:31:08,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:08,281 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:31:08,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:31:08,282 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:08,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:08,282 INFO L85 PathProgramCache]: Analyzing trace with hash -202771, now seen corresponding path program 1 times [2024-11-09 19:31:08,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:08,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537736870] [2024-11-09 19:31:08,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:08,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-09 19:31:08,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:08,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537736870] [2024-11-09 19:31:08,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537736870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:08,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:31:08,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 19:31:08,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256869439] [2024-11-09 19:31:08,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:08,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:31:08,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:08,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:31:08,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:31:08,929 INFO L87 Difference]: Start difference. First operand 88741 states and 183907 transitions. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:13,203 INFO L93 Difference]: Finished difference Result 177480 states and 367812 transitions. [2024-11-09 19:31:13,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:13,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 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 391 [2024-11-09 19:31:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:13,490 INFO L225 Difference]: With dead ends: 177480 [2024-11-09 19:31:13,490 INFO L226 Difference]: Without dead ends: 88741 [2024-11-09 19:31:13,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09 19:31:13,522 INFO L432 NwaCegarLoop]: 1951 mSDtfsCounter, 4257 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 5627 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4257 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 6173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 5627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:13,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4257 Valid, 1965 Invalid, 6173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 5627 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 19:31:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88741 states. [2024-11-09 19:31:14,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88741 to 87237. [2024-11-09 19:31:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87237 states, 87236 states have (on average 2.0226970516759137) internal successors, (176452), 87236 states have internal predecessors, (176452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87237 states to 87237 states and 176452 transitions. [2024-11-09 19:31:14,557 INFO L78 Accepts]: Start accepts. Automaton has 87237 states and 176452 transitions. Word has length 391 [2024-11-09 19:31:14,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:14,558 INFO L471 AbstractCegarLoop]: Abstraction has 87237 states and 176452 transitions. [2024-11-09 19:31:14,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 87237 states and 176452 transitions. [2024-11-09 19:31:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2024-11-09 19:31:14,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:14,562 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:31:14,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:31:14,562 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:14,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:14,563 INFO L85 PathProgramCache]: Analyzing trace with hash -854113477, now seen corresponding path program 1 times [2024-11-09 19:31:14,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:14,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055628058] [2024-11-09 19:31:14,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:14,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-09 19:31:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:15,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055628058] [2024-11-09 19:31:15,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055628058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:15,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:31:15,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:31:15,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659987524] [2024-11-09 19:31:15,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:15,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:31:15,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:15,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:31:15,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:31:15,133 INFO L87 Difference]: Start difference. First operand 87237 states and 176452 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:18,967 INFO L93 Difference]: Finished difference Result 196280 states and 397441 transitions. [2024-11-09 19:31:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:18,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 400 [2024-11-09 19:31:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:19,118 INFO L225 Difference]: With dead ends: 196280 [2024-11-09 19:31:19,119 INFO L226 Difference]: Without dead ends: 109045 [2024-11-09 19:31:19,147 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-09 19:31:19,148 INFO L432 NwaCegarLoop]: 1888 mSDtfsCounter, 1360 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3607 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 3990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 3607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:19,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 1898 Invalid, 3990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 3607 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 19:31:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109045 states. [2024-11-09 19:31:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109045 to 104533. [2024-11-09 19:31:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104533 states, 104532 states have (on average 1.9945375578770137) internal successors, (208493), 104532 states have internal predecessors, (208493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:20,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104533 states to 104533 states and 208493 transitions. [2024-11-09 19:31:20,720 INFO L78 Accepts]: Start accepts. Automaton has 104533 states and 208493 transitions. Word has length 400 [2024-11-09 19:31:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:20,721 INFO L471 AbstractCegarLoop]: Abstraction has 104533 states and 208493 transitions. [2024-11-09 19:31:20,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 104533 states and 208493 transitions. [2024-11-09 19:31:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-09 19:31:20,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:20,727 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:31:20,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:31:20,727 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:20,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash 355929379, now seen corresponding path program 1 times [2024-11-09 19:31:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:20,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796621472] [2024-11-09 19:31:20,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:20,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 19:31:21,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796621472] [2024-11-09 19:31:21,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796621472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:21,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:31:21,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:31:21,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401731730] [2024-11-09 19:31:21,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:21,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:31:21,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:21,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:31:21,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:31:21,319 INFO L87 Difference]: Start difference. First operand 104533 states and 208493 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:24,990 INFO L93 Difference]: Finished difference Result 228616 states and 455995 transitions. [2024-11-09 19:31:24,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:24,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 408 [2024-11-09 19:31:24,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:25,163 INFO L225 Difference]: With dead ends: 228616 [2024-11-09 19:31:25,163 INFO L226 Difference]: Without dead ends: 114309 [2024-11-09 19:31:25,182 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-09 19:31:25,183 INFO L432 NwaCegarLoop]: 2026 mSDtfsCounter, 1417 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3343 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 3727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 3343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:25,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 2036 Invalid, 3727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 3343 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 19:31:25,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114309 states. [2024-11-09 19:31:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114309 to 66933. [2024-11-09 19:31:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66933 states, 66932 states have (on average 1.9813840913165601) internal successors, (132618), 66932 states have internal predecessors, (132618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66933 states to 66933 states and 132618 transitions. [2024-11-09 19:31:26,462 INFO L78 Accepts]: Start accepts. Automaton has 66933 states and 132618 transitions. Word has length 408 [2024-11-09 19:31:26,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:26,463 INFO L471 AbstractCegarLoop]: Abstraction has 66933 states and 132618 transitions. [2024-11-09 19:31:26,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 66933 states and 132618 transitions. [2024-11-09 19:31:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-11-09 19:31:26,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:26,469 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:31:26,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:31:26,469 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:26,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1516288549, now seen corresponding path program 1 times [2024-11-09 19:31:26,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:26,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007736755] [2024-11-09 19:31:26,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:26,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 341 proven. 16 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 19:31:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:27,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007736755] [2024-11-09 19:31:27,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007736755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:31:27,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663945963] [2024-11-09 19:31:27,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:27,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:31:27,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:31:27,373 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:31:27,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:31:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:27,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:31:27,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:31:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-09 19:31:27,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:31:27,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663945963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:27,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:31:27,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:31:27,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454452020] [2024-11-09 19:31:27,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:27,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:31:27,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:27,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:31:27,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:31:27,608 INFO L87 Difference]: Start difference. First operand 66933 states and 132618 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:30,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:30,426 INFO L93 Difference]: Finished difference Result 133864 states and 265234 transitions. [2024-11-09 19:31:30,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:30,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 432 [2024-11-09 19:31:30,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:30,508 INFO L225 Difference]: With dead ends: 133864 [2024-11-09 19:31:30,508 INFO L226 Difference]: Without dead ends: 66933 [2024-11-09 19:31:30,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:31:30,545 INFO L432 NwaCegarLoop]: 1879 mSDtfsCounter, 1427 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3292 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 3490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 3292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:30,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 1889 Invalid, 3490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 3292 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 19:31:30,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66933 states. [2024-11-09 19:31:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66933 to 63925. [2024-11-09 19:31:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63925 states, 63924 states have (on average 1.972717602152556) internal successors, (126104), 63924 states have internal predecessors, (126104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63925 states to 63925 states and 126104 transitions. [2024-11-09 19:31:31,309 INFO L78 Accepts]: Start accepts. Automaton has 63925 states and 126104 transitions. Word has length 432 [2024-11-09 19:31:31,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:31,310 INFO L471 AbstractCegarLoop]: Abstraction has 63925 states and 126104 transitions. [2024-11-09 19:31:31,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 63925 states and 126104 transitions. [2024-11-09 19:31:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2024-11-09 19:31:31,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:31,315 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:31:31,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 19:31:31,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 19:31:31,516 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:31,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:31,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1030895897, now seen corresponding path program 1 times [2024-11-09 19:31:31,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:31,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487411909] [2024-11-09 19:31:31,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:31,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-09 19:31:32,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:32,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487411909] [2024-11-09 19:31:32,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487411909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:32,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:31:32,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:31:32,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105106959] [2024-11-09 19:31:32,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:32,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:31:32,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:32,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:31:32,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:31:32,094 INFO L87 Difference]: Start difference. First operand 63925 states and 126104 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)