./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/Problem11_label55.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 3ed93fbea5c4ce7662a30833852408f6a41bed2c847c0002d827dceaca299880 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:50:58,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:50:58,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:50:58,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:50:58,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:50:58,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:50:58,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:50:58,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:50:58,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:50:58,652 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:50:58,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:50:58,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:50:58,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:50:58,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:50:58,657 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:50:58,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:50:58,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:50:58,658 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:50:58,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:50:58,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:50:58,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:50:58,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:50:58,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:50:58,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:50:58,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:50:58,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:50:58,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:50:58,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:50:58,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:50:58,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:50:58,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:50:58,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:50:58,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:50:58,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:50:58,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:50:58,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:50:58,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:50:58,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:50:58,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:50:58,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:50:58,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:50:58,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:50:58,666 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 -> 3ed93fbea5c4ce7662a30833852408f6a41bed2c847c0002d827dceaca299880 [2024-11-11 16:50:58,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:50:58,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:50:58,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:50:58,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:50:58,910 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:50:58,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label55.c [2024-11-11 16:51:00,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:51:00,334 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:51:00,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label55.c [2024-11-11 16:51:00,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b4c53fd/24c22434faec42c2a37e1359d315f96b/FLAG43bbc8952 [2024-11-11 16:51:00,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b4c53fd/24c22434faec42c2a37e1359d315f96b [2024-11-11 16:51:00,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:51:00,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:51:00,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:51:00,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:51:00,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:51:00,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:51:00" (1/1) ... [2024-11-11 16:51:00,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af3a78b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00, skipping insertion in model container [2024-11-11 16:51:00,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:51:00" (1/1) ... [2024-11-11 16:51:00,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:51:00,627 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/Problem11_label55.c[6546,6559] [2024-11-11 16:51:00,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:51:00,788 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:51:00,806 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/Problem11_label55.c[6546,6559] [2024-11-11 16:51:00,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:51:00,901 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:51:00,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00 WrapperNode [2024-11-11 16:51:00,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:51:00,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:51:00,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:51:00,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:51:00,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00" (1/1) ... [2024-11-11 16:51:00,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00" (1/1) ... [2024-11-11 16:51:00,998 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-11 16:51:00,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:51:01,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:51:01,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:51:01,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:51:01,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00" (1/1) ... [2024-11-11 16:51:01,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00" (1/1) ... [2024-11-11 16:51:01,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00" (1/1) ... [2024-11-11 16:51:01,088 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-11 16:51:01,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00" (1/1) ... [2024-11-11 16:51:01,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00" (1/1) ... [2024-11-11 16:51:01,122 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00" (1/1) ... [2024-11-11 16:51:01,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00" (1/1) ... [2024-11-11 16:51:01,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00" (1/1) ... [2024-11-11 16:51:01,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00" (1/1) ... [2024-11-11 16:51:01,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:51:01,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:51:01,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:51:01,168 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:51:01,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00" (1/1) ... [2024-11-11 16:51:01,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:51:01,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:51:01,202 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-11 16:51:01,205 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-11 16:51:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:51:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:51:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:51:01,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:51:01,326 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:51:01,329 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:51:02,435 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-11 16:51:02,436 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:51:02,454 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:51:02,455 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:51:02,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:51:02 BoogieIcfgContainer [2024-11-11 16:51:02,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:51:02,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:51:02,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:51:02,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:51:02,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:51:00" (1/3) ... [2024-11-11 16:51:02,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c2d21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:51:02, skipping insertion in model container [2024-11-11 16:51:02,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:51:00" (2/3) ... [2024-11-11 16:51:02,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c2d21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:51:02, skipping insertion in model container [2024-11-11 16:51:02,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:51:02" (3/3) ... [2024-11-11 16:51:02,463 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label55.c [2024-11-11 16:51:02,474 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:51:02,475 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:51:02,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:51:02,537 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;@6696e1c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:51:02,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:51:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 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-11 16:51:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 16:51:02,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:02,550 INFO L218 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] [2024-11-11 16:51:02,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:02,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2024-11-11 16:51:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:02,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041682901] [2024-11-11 16:51:02,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:02,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:02,847 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-11 16:51:02,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:02,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041682901] [2024-11-11 16:51:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041682901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:02,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:02,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:51:02,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047925348] [2024-11-11 16:51:02,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:02,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:02,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:02,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:02,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:02,887 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 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.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-11 16:51:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:03,752 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2024-11-11 16:51:03,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:03,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-11-11 16:51:03,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:03,763 INFO L225 Difference]: With dead ends: 776 [2024-11-11 16:51:03,763 INFO L226 Difference]: Without dead ends: 413 [2024-11-11 16:51:03,766 INFO L434 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-11 16:51:03,768 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 182 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:03,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:51:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-11 16:51:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2024-11-11 16:51:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 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-11 16:51:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2024-11-11 16:51:03,817 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 45 [2024-11-11 16:51:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:03,818 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2024-11-11 16:51:03,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-11 16:51:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2024-11-11 16:51:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 16:51:03,820 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:03,821 INFO L218 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-11 16:51:03,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:51:03,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:03,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:03,822 INFO L85 PathProgramCache]: Analyzing trace with hash -954308976, now seen corresponding path program 1 times [2024-11-11 16:51:03,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:03,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646298850] [2024-11-11 16:51:03,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:03,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:03,990 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-11 16:51:03,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:03,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646298850] [2024-11-11 16:51:03,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646298850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:03,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:03,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:51:03,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37305820] [2024-11-11 16:51:03,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:03,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:03,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:03,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:03,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:03,997 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 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-11 16:51:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:04,628 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2024-11-11 16:51:04,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:04,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 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-11 16:51:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:04,635 INFO L225 Difference]: With dead ends: 1209 [2024-11-11 16:51:04,636 INFO L226 Difference]: Without dead ends: 800 [2024-11-11 16:51:04,637 INFO L434 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-11 16:51:04,637 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:04,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:04,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-11 16:51:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2024-11-11 16:51:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3854961832061068) internal successors, (1089), 786 states have internal predecessors, (1089), 0 states have call successors, (0), 0 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-11 16:51:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1089 transitions. [2024-11-11 16:51:04,663 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1089 transitions. Word has length 113 [2024-11-11 16:51:04,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:04,663 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1089 transitions. [2024-11-11 16:51:04,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 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-11 16:51:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1089 transitions. [2024-11-11 16:51:04,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 16:51:04,666 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:04,666 INFO L218 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] [2024-11-11 16:51:04,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:51:04,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:04,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:04,667 INFO L85 PathProgramCache]: Analyzing trace with hash 975979568, now seen corresponding path program 1 times [2024-11-11 16:51:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:04,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585328661] [2024-11-11 16:51:04,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:04,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:04,911 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-11 16:51:04,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:04,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585328661] [2024-11-11 16:51:04,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585328661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:04,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:04,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:51:04,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38972250] [2024-11-11 16:51:04,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:04,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:04,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:04,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:04,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:04,916 INFO L87 Difference]: Start difference. First operand 787 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-11 16:51:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:05,486 INFO L93 Difference]: Finished difference Result 1942 states and 2631 transitions. [2024-11-11 16:51:05,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:05,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-11 16:51:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:05,493 INFO L225 Difference]: With dead ends: 1942 [2024-11-11 16:51:05,493 INFO L226 Difference]: Without dead ends: 1157 [2024-11-11 16:51:05,494 INFO L434 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-11 16:51:05,495 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:05,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-11 16:51:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-11-11 16:51:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277922077922078) internal successors, (1476), 1155 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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-11 16:51:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1476 transitions. [2024-11-11 16:51:05,512 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1476 transitions. Word has length 114 [2024-11-11 16:51:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:05,512 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1476 transitions. [2024-11-11 16:51:05,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-11 16:51:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1476 transitions. [2024-11-11 16:51:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-11 16:51:05,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:05,521 INFO L218 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] [2024-11-11 16:51:05,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:51:05,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:05,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:05,522 INFO L85 PathProgramCache]: Analyzing trace with hash -103496756, now seen corresponding path program 1 times [2024-11-11 16:51:05,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:05,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053258439] [2024-11-11 16:51:05,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:05,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-11 16:51:05,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:05,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053258439] [2024-11-11 16:51:05,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053258439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:05,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:05,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:51:05,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087653796] [2024-11-11 16:51:05,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:05,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:05,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:05,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:05,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:05,699 INFO L87 Difference]: Start difference. First operand 1156 states and 1476 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-11 16:51:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:06,305 INFO L93 Difference]: Finished difference Result 2502 states and 3339 transitions. [2024-11-11 16:51:06,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:06,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 157 [2024-11-11 16:51:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:06,310 INFO L225 Difference]: With dead ends: 2502 [2024-11-11 16:51:06,310 INFO L226 Difference]: Without dead ends: 1532 [2024-11-11 16:51:06,311 INFO L434 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-11 16:51:06,311 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:06,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 156 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:06,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-11 16:51:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2024-11-11 16:51:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.2619203135205748) internal successors, (1932), 1531 states have internal predecessors, (1932), 0 states have call successors, (0), 0 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-11 16:51:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1932 transitions. [2024-11-11 16:51:06,329 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1932 transitions. Word has length 157 [2024-11-11 16:51:06,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:06,330 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1932 transitions. [2024-11-11 16:51:06,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-11 16:51:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1932 transitions. [2024-11-11 16:51:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-11 16:51:06,331 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:06,331 INFO L218 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] [2024-11-11 16:51:06,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:51:06,332 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:06,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:06,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1015853899, now seen corresponding path program 1 times [2024-11-11 16:51:06,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:06,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506189278] [2024-11-11 16:51:06,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:06,488 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-11 16:51:06,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:06,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506189278] [2024-11-11 16:51:06,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506189278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:06,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:06,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:06,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607820039] [2024-11-11 16:51:06,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:06,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:06,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:06,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:06,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:06,491 INFO L87 Difference]: Start difference. First operand 1532 states and 1932 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 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-11 16:51:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:07,066 INFO L93 Difference]: Finished difference Result 3644 states and 4738 transitions. [2024-11-11 16:51:07,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:07,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2024-11-11 16:51:07,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:07,074 INFO L225 Difference]: With dead ends: 3644 [2024-11-11 16:51:07,074 INFO L226 Difference]: Without dead ends: 2298 [2024-11-11 16:51:07,076 INFO L434 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-11 16:51:07,077 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 190 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:07,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:07,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2024-11-11 16:51:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2295. [2024-11-11 16:51:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 2294 states have (on average 1.2654751525719268) internal successors, (2903), 2294 states have internal predecessors, (2903), 0 states have call successors, (0), 0 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-11 16:51:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2903 transitions. [2024-11-11 16:51:07,105 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2903 transitions. Word has length 172 [2024-11-11 16:51:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:07,105 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 2903 transitions. [2024-11-11 16:51:07,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 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-11 16:51:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2903 transitions. [2024-11-11 16:51:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-11 16:51:07,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:07,108 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:51:07,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:51:07,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:07,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:07,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1543850387, now seen corresponding path program 1 times [2024-11-11 16:51:07,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:07,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403822828] [2024-11-11 16:51:07,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:07,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:07,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403822828] [2024-11-11 16:51:07,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403822828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:07,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:07,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:07,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435573190] [2024-11-11 16:51:07,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:07,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:07,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:07,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:07,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:07,295 INFO L87 Difference]: Start difference. First operand 2295 states and 2903 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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-11 16:51:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:07,902 INFO L93 Difference]: Finished difference Result 5528 states and 7095 transitions. [2024-11-11 16:51:07,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:07,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2024-11-11 16:51:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:07,913 INFO L225 Difference]: With dead ends: 5528 [2024-11-11 16:51:07,913 INFO L226 Difference]: Without dead ends: 3419 [2024-11-11 16:51:07,915 INFO L434 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-11 16:51:07,917 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:07,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 340 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2024-11-11 16:51:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3218. [2024-11-11 16:51:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 3217 states have (on average 1.2377991917935964) internal successors, (3982), 3217 states have internal predecessors, (3982), 0 states have call successors, (0), 0 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-11 16:51:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 3982 transitions. [2024-11-11 16:51:07,977 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 3982 transitions. Word has length 225 [2024-11-11 16:51:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:07,978 INFO L471 AbstractCegarLoop]: Abstraction has 3218 states and 3982 transitions. [2024-11-11 16:51:07,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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-11 16:51:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 3982 transitions. [2024-11-11 16:51:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-11 16:51:07,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:07,984 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:51:07,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:51:07,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:07,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1109508493, now seen corresponding path program 1 times [2024-11-11 16:51:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:07,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432224430] [2024-11-11 16:51:07,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:07,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-11 16:51:08,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:08,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432224430] [2024-11-11 16:51:08,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432224430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:08,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:08,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:08,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059300443] [2024-11-11 16:51:08,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:08,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:08,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:08,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:08,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:08,156 INFO L87 Difference]: Start difference. First operand 3218 states and 3982 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-11 16:51:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:08,702 INFO L93 Difference]: Finished difference Result 7371 states and 9143 transitions. [2024-11-11 16:51:08,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:08,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 226 [2024-11-11 16:51:08,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:08,711 INFO L225 Difference]: With dead ends: 7371 [2024-11-11 16:51:08,711 INFO L226 Difference]: Without dead ends: 4155 [2024-11-11 16:51:08,714 INFO L434 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-11 16:51:08,715 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 157 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:08,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 345 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2024-11-11 16:51:08,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 4138. [2024-11-11 16:51:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4138 states, 4137 states have (on average 1.2211747643219724) internal successors, (5052), 4137 states have internal predecessors, (5052), 0 states have call successors, (0), 0 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-11 16:51:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4138 states to 4138 states and 5052 transitions. [2024-11-11 16:51:08,784 INFO L78 Accepts]: Start accepts. Automaton has 4138 states and 5052 transitions. Word has length 226 [2024-11-11 16:51:08,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:08,784 INFO L471 AbstractCegarLoop]: Abstraction has 4138 states and 5052 transitions. [2024-11-11 16:51:08,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-11 16:51:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 5052 transitions. [2024-11-11 16:51:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-11 16:51:08,786 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:08,786 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:51:08,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:51:08,787 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:08,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash 616043864, now seen corresponding path program 1 times [2024-11-11 16:51:08,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:08,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301401827] [2024-11-11 16:51:08,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:08,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:08,929 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-11 16:51:08,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:08,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301401827] [2024-11-11 16:51:08,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301401827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:08,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:08,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:08,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775934252] [2024-11-11 16:51:08,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:08,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:08,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:08,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:08,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:08,932 INFO L87 Difference]: Start difference. First operand 4138 states and 5052 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-11 16:51:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:09,565 INFO L93 Difference]: Finished difference Result 9207 states and 11353 transitions. [2024-11-11 16:51:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:09,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 227 [2024-11-11 16:51:09,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:09,575 INFO L225 Difference]: With dead ends: 9207 [2024-11-11 16:51:09,576 INFO L226 Difference]: Without dead ends: 5071 [2024-11-11 16:51:09,578 INFO L434 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-11 16:51:09,579 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 152 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:09,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 379 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5071 states. [2024-11-11 16:51:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5071 to 4874. [2024-11-11 16:51:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4873 states have (on average 1.2087010055407346) internal successors, (5890), 4873 states have internal predecessors, (5890), 0 states have call successors, (0), 0 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-11 16:51:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 5890 transitions. [2024-11-11 16:51:09,624 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 5890 transitions. Word has length 227 [2024-11-11 16:51:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:09,625 INFO L471 AbstractCegarLoop]: Abstraction has 4874 states and 5890 transitions. [2024-11-11 16:51:09,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-11 16:51:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 5890 transitions. [2024-11-11 16:51:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-11 16:51:09,627 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:09,627 INFO L218 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, 1, 1, 1, 1, 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-11 16:51:09,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:51:09,628 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:09,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:09,628 INFO L85 PathProgramCache]: Analyzing trace with hash 213296906, now seen corresponding path program 1 times [2024-11-11 16:51:09,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:09,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31211449] [2024-11-11 16:51:09,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:09,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:09,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:09,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31211449] [2024-11-11 16:51:09,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31211449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:09,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:09,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619662768] [2024-11-11 16:51:09,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:09,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:09,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:09,887 INFO L87 Difference]: Start difference. First operand 4874 states and 5890 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 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-11 16:51:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:10,861 INFO L93 Difference]: Finished difference Result 15870 states and 19335 transitions. [2024-11-11 16:51:10,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:10,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2024-11-11 16:51:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:10,895 INFO L225 Difference]: With dead ends: 15870 [2024-11-11 16:51:10,895 INFO L226 Difference]: Without dead ends: 10998 [2024-11-11 16:51:10,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:10,901 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 290 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:10,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 193 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 16:51:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10998 states. [2024-11-11 16:51:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10998 to 8953. [2024-11-11 16:51:11,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8953 states, 8952 states have (on average 1.1907953529937445) internal successors, (10660), 8952 states have internal predecessors, (10660), 0 states have call successors, (0), 0 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-11 16:51:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8953 states to 8953 states and 10660 transitions. [2024-11-11 16:51:11,047 INFO L78 Accepts]: Start accepts. Automaton has 8953 states and 10660 transitions. Word has length 247 [2024-11-11 16:51:11,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:11,047 INFO L471 AbstractCegarLoop]: Abstraction has 8953 states and 10660 transitions. [2024-11-11 16:51:11,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 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-11 16:51:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 8953 states and 10660 transitions. [2024-11-11 16:51:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-11 16:51:11,052 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:11,052 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:51:11,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:51:11,053 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:11,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:11,053 INFO L85 PathProgramCache]: Analyzing trace with hash 389049443, now seen corresponding path program 1 times [2024-11-11 16:51:11,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:11,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239800520] [2024-11-11 16:51:11,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:11,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239800520] [2024-11-11 16:51:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239800520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:11,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041068632] [2024-11-11 16:51:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:11,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:11,333 INFO L87 Difference]: Start difference. First operand 8953 states and 10660 transitions. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:12,287 INFO L93 Difference]: Finished difference Result 22713 states and 27383 transitions. [2024-11-11 16:51:12,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:12,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 257 [2024-11-11 16:51:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:12,305 INFO L225 Difference]: With dead ends: 22713 [2024-11-11 16:51:12,305 INFO L226 Difference]: Without dead ends: 13762 [2024-11-11 16:51:12,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:12,315 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 300 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:12,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 120 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 16:51:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13762 states. [2024-11-11 16:51:12,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13762 to 13378. [2024-11-11 16:51:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13378 states, 13377 states have (on average 1.1920460491889064) internal successors, (15946), 13377 states have internal predecessors, (15946), 0 states have call successors, (0), 0 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-11 16:51:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13378 states to 13378 states and 15946 transitions. [2024-11-11 16:51:12,471 INFO L78 Accepts]: Start accepts. Automaton has 13378 states and 15946 transitions. Word has length 257 [2024-11-11 16:51:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:12,471 INFO L471 AbstractCegarLoop]: Abstraction has 13378 states and 15946 transitions. [2024-11-11 16:51:12,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 13378 states and 15946 transitions. [2024-11-11 16:51:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-11 16:51:12,475 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:12,476 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:51:12,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:51:12,477 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:12,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:12,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1785532527, now seen corresponding path program 1 times [2024-11-11 16:51:12,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:12,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797802329] [2024-11-11 16:51:12,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:12,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 23 proven. 62 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-11 16:51:12,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:12,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797802329] [2024-11-11 16:51:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797802329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:51:12,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759390652] [2024-11-11 16:51:12,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:12,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:12,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:51:12,725 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-11 16:51:12,726 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-11 16:51:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:12,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:51:12,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:51:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-11 16:51:12,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:51:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759390652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:12,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:51:12,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 16:51:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841371013] [2024-11-11 16:51:12,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:12,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:12,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:12,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:12,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:51:12,931 INFO L87 Difference]: Start difference. First operand 13378 states and 15946 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 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-11 16:51:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:13,580 INFO L93 Difference]: Finished difference Result 32089 states and 38433 transitions. [2024-11-11 16:51:13,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:13,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 259 [2024-11-11 16:51:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:13,609 INFO L225 Difference]: With dead ends: 32089 [2024-11-11 16:51:13,609 INFO L226 Difference]: Without dead ends: 18713 [2024-11-11 16:51:13,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:51:13,621 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 155 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:13,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 375 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:13,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18713 states. [2024-11-11 16:51:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18713 to 17789. [2024-11-11 16:51:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17789 states, 17788 states have (on average 1.1721385203507984) internal successors, (20850), 17788 states have internal predecessors, (20850), 0 states have call successors, (0), 0 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-11 16:51:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17789 states to 17789 states and 20850 transitions. [2024-11-11 16:51:13,854 INFO L78 Accepts]: Start accepts. Automaton has 17789 states and 20850 transitions. Word has length 259 [2024-11-11 16:51:13,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:13,854 INFO L471 AbstractCegarLoop]: Abstraction has 17789 states and 20850 transitions. [2024-11-11 16:51:13,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 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-11 16:51:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 17789 states and 20850 transitions. [2024-11-11 16:51:13,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-11 16:51:13,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:13,860 INFO L218 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, 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-11 16:51:13,875 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-11 16:51:14,060 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,SelfDestructingSolverStorable10 [2024-11-11 16:51:14,060 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:14,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:14,061 INFO L85 PathProgramCache]: Analyzing trace with hash -909161094, now seen corresponding path program 1 times [2024-11-11 16:51:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:14,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513244156] [2024-11-11 16:51:14,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:14,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-11 16:51:14,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:14,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513244156] [2024-11-11 16:51:14,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513244156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:14,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:14,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:14,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555351249] [2024-11-11 16:51:14,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:14,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:14,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:14,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:14,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:14,234 INFO L87 Difference]: Start difference. First operand 17789 states and 20850 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-11 16:51:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:14,823 INFO L93 Difference]: Finished difference Result 35586 states and 41718 transitions. [2024-11-11 16:51:14,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:14,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 264 [2024-11-11 16:51:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:14,840 INFO L225 Difference]: With dead ends: 35586 [2024-11-11 16:51:14,840 INFO L226 Difference]: Without dead ends: 17799 [2024-11-11 16:51:14,852 INFO L434 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-11 16:51:14,852 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 155 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:14,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 377 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:14,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17799 states. [2024-11-11 16:51:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17799 to 17788. [2024-11-11 16:51:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17788 states, 17787 states have (on average 1.1440377804014168) internal successors, (20349), 17787 states have internal predecessors, (20349), 0 states have call successors, (0), 0 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-11 16:51:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17788 states to 17788 states and 20349 transitions. [2024-11-11 16:51:14,992 INFO L78 Accepts]: Start accepts. Automaton has 17788 states and 20349 transitions. Word has length 264 [2024-11-11 16:51:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:14,993 INFO L471 AbstractCegarLoop]: Abstraction has 17788 states and 20349 transitions. [2024-11-11 16:51:14,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-11 16:51:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 17788 states and 20349 transitions. [2024-11-11 16:51:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-11 16:51:14,998 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:14,998 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:51:14,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:51:14,998 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:14,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1936772335, now seen corresponding path program 1 times [2024-11-11 16:51:14,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:14,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375493509] [2024-11-11 16:51:14,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:14,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 141 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:15,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:15,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375493509] [2024-11-11 16:51:15,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375493509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:51:15,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652166937] [2024-11-11 16:51:15,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:15,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:15,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:51:15,408 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-11 16:51:15,409 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-11 16:51:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:15,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:51:15,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:51:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:15,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:51:15,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652166937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:15,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:51:15,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 16:51:15,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260537323] [2024-11-11 16:51:15,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:15,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:15,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:15,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:15,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:51:15,862 INFO L87 Difference]: Start difference. First operand 17788 states and 20349 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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-11 16:51:16,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:16,518 INFO L93 Difference]: Finished difference Result 35578 states and 40702 transitions. [2024-11-11 16:51:16,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:16,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 278 [2024-11-11 16:51:16,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:16,537 INFO L225 Difference]: With dead ends: 35578 [2024-11-11 16:51:16,537 INFO L226 Difference]: Without dead ends: 17792 [2024-11-11 16:51:16,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:51:16,549 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 172 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:16,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 177 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17792 states. [2024-11-11 16:51:16,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17792 to 17788. [2024-11-11 16:51:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17788 states, 17787 states have (on average 1.1430258053634677) internal successors, (20331), 17787 states have internal predecessors, (20331), 0 states have call successors, (0), 0 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-11 16:51:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17788 states to 17788 states and 20331 transitions. [2024-11-11 16:51:16,744 INFO L78 Accepts]: Start accepts. Automaton has 17788 states and 20331 transitions. Word has length 278 [2024-11-11 16:51:16,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:16,745 INFO L471 AbstractCegarLoop]: Abstraction has 17788 states and 20331 transitions. [2024-11-11 16:51:16,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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-11 16:51:16,745 INFO L276 IsEmpty]: Start isEmpty. Operand 17788 states and 20331 transitions. [2024-11-11 16:51:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-11 16:51:16,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:16,752 INFO L218 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, 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] [2024-11-11 16:51:16,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 16:51:16,952 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,SelfDestructingSolverStorable12 [2024-11-11 16:51:16,953 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:16,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:16,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1415119139, now seen corresponding path program 1 times [2024-11-11 16:51:16,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:16,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379916243] [2024-11-11 16:51:16,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:16,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-11 16:51:17,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:17,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379916243] [2024-11-11 16:51:17,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379916243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:17,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:17,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:51:17,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830854679] [2024-11-11 16:51:17,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:17,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:17,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:17,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:17,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:17,115 INFO L87 Difference]: Start difference. First operand 17788 states and 20331 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-11 16:51:17,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:17,690 INFO L93 Difference]: Finished difference Result 33137 states and 37923 transitions. [2024-11-11 16:51:17,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:17,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 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 304 [2024-11-11 16:51:17,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:17,706 INFO L225 Difference]: With dead ends: 33137 [2024-11-11 16:51:17,706 INFO L226 Difference]: Without dead ends: 15351 [2024-11-11 16:51:17,718 INFO L434 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-11 16:51:17,719 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 124 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:17,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 149 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15351 states. [2024-11-11 16:51:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15351 to 10741. [2024-11-11 16:51:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10741 states, 10740 states have (on average 1.116294227188082) internal successors, (11989), 10740 states have internal predecessors, (11989), 0 states have call successors, (0), 0 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-11 16:51:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10741 states to 10741 states and 11989 transitions. [2024-11-11 16:51:17,807 INFO L78 Accepts]: Start accepts. Automaton has 10741 states and 11989 transitions. Word has length 304 [2024-11-11 16:51:17,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:17,807 INFO L471 AbstractCegarLoop]: Abstraction has 10741 states and 11989 transitions. [2024-11-11 16:51:17,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-11 16:51:17,807 INFO L276 IsEmpty]: Start isEmpty. Operand 10741 states and 11989 transitions. [2024-11-11 16:51:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-11 16:51:17,811 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:17,811 INFO L218 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, 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] [2024-11-11 16:51:17,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 16:51:17,812 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:17,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash 63979177, now seen corresponding path program 1 times [2024-11-11 16:51:17,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:17,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14922150] [2024-11-11 16:51:17,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:17,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2024-11-11 16:51:17,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:17,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14922150] [2024-11-11 16:51:17,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14922150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:17,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:17,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:17,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317428454] [2024-11-11 16:51:17,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:17,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:17,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:17,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:17,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:17,918 INFO L87 Difference]: Start difference. First operand 10741 states and 11989 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-11 16:51:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:18,410 INFO L93 Difference]: Finished difference Result 23503 states and 26240 transitions. [2024-11-11 16:51:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:18,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 312 [2024-11-11 16:51:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:18,422 INFO L225 Difference]: With dead ends: 23503 [2024-11-11 16:51:18,423 INFO L226 Difference]: Without dead ends: 12764 [2024-11-11 16:51:18,430 INFO L434 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-11 16:51:18,431 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 176 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:18,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 144 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:18,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12764 states. [2024-11-11 16:51:18,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12764 to 10924. [2024-11-11 16:51:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10924 states, 10923 states have (on average 1.1170008239494644) internal successors, (12201), 10923 states have internal predecessors, (12201), 0 states have call successors, (0), 0 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-11 16:51:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10924 states to 10924 states and 12201 transitions. [2024-11-11 16:51:18,514 INFO L78 Accepts]: Start accepts. Automaton has 10924 states and 12201 transitions. Word has length 312 [2024-11-11 16:51:18,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:18,514 INFO L471 AbstractCegarLoop]: Abstraction has 10924 states and 12201 transitions. [2024-11-11 16:51:18,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-11 16:51:18,515 INFO L276 IsEmpty]: Start isEmpty. Operand 10924 states and 12201 transitions. [2024-11-11 16:51:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-11 16:51:18,519 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:18,519 INFO L218 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, 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] [2024-11-11 16:51:18,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 16:51:18,519 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:18,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1564114315, now seen corresponding path program 1 times [2024-11-11 16:51:18,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:18,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097424488] [2024-11-11 16:51:18,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:18,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-11 16:51:18,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:18,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097424488] [2024-11-11 16:51:18,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097424488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:18,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:18,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:18,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938612208] [2024-11-11 16:51:18,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:18,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:18,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:18,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:18,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:18,856 INFO L87 Difference]: Start difference. First operand 10924 states and 12201 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 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-11 16:51:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:19,691 INFO L93 Difference]: Finished difference Result 27404 states and 30590 transitions. [2024-11-11 16:51:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:19,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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 316 [2024-11-11 16:51:19,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:19,704 INFO L225 Difference]: With dead ends: 27404 [2024-11-11 16:51:19,704 INFO L226 Difference]: Without dead ends: 15741 [2024-11-11 16:51:19,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:19,712 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 295 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:19,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 399 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:51:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15741 states. [2024-11-11 16:51:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15741 to 12413. [2024-11-11 16:51:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12413 states, 12412 states have (on average 1.117386400257815) internal successors, (13869), 12412 states have internal predecessors, (13869), 0 states have call successors, (0), 0 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-11 16:51:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12413 states to 12413 states and 13869 transitions. [2024-11-11 16:51:19,820 INFO L78 Accepts]: Start accepts. Automaton has 12413 states and 13869 transitions. Word has length 316 [2024-11-11 16:51:19,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:19,820 INFO L471 AbstractCegarLoop]: Abstraction has 12413 states and 13869 transitions. [2024-11-11 16:51:19,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 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-11 16:51:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 12413 states and 13869 transitions. [2024-11-11 16:51:19,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-11 16:51:19,825 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:19,825 INFO L218 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, 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] [2024-11-11 16:51:19,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 16:51:19,826 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:19,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:19,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1085023565, now seen corresponding path program 1 times [2024-11-11 16:51:19,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:19,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741381763] [2024-11-11 16:51:19,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:19,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 174 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-11 16:51:20,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:20,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741381763] [2024-11-11 16:51:20,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741381763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:51:20,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754305926] [2024-11-11 16:51:20,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:20,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:20,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:51:20,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:51:20,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 16:51:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:20,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:51:20,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:51:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-11 16:51:20,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:51:20,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754305926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:20,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:51:20,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-11 16:51:20,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986270610] [2024-11-11 16:51:20,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:20,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:20,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:20,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:20,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:51:20,932 INFO L87 Difference]: Start difference. First operand 12413 states and 13869 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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-11 16:51:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:21,589 INFO L93 Difference]: Finished difference Result 25010 states and 27928 transitions. [2024-11-11 16:51:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:21,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 332 [2024-11-11 16:51:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:21,599 INFO L225 Difference]: With dead ends: 25010 [2024-11-11 16:51:21,600 INFO L226 Difference]: Without dead ends: 12599 [2024-11-11 16:51:21,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:51:21,609 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 293 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:21,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 150 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:21,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12599 states. [2024-11-11 16:51:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12599 to 12413. [2024-11-11 16:51:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12413 states, 12412 states have (on average 1.116419593941347) internal successors, (13857), 12412 states have internal predecessors, (13857), 0 states have call successors, (0), 0 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-11 16:51:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12413 states to 12413 states and 13857 transitions. [2024-11-11 16:51:21,758 INFO L78 Accepts]: Start accepts. Automaton has 12413 states and 13857 transitions. Word has length 332 [2024-11-11 16:51:21,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:21,758 INFO L471 AbstractCegarLoop]: Abstraction has 12413 states and 13857 transitions. [2024-11-11 16:51:21,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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-11 16:51:21,758 INFO L276 IsEmpty]: Start isEmpty. Operand 12413 states and 13857 transitions. [2024-11-11 16:51:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-11 16:51:21,766 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:21,766 INFO L218 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, 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-11 16:51:21,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 16:51:21,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:21,967 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:21,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:21,967 INFO L85 PathProgramCache]: Analyzing trace with hash 474538808, now seen corresponding path program 1 times [2024-11-11 16:51:21,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:21,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716124499] [2024-11-11 16:51:21,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:21,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-11 16:51:22,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:22,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716124499] [2024-11-11 16:51:22,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716124499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:22,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:22,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:22,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812614329] [2024-11-11 16:51:22,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:22,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:22,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:22,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:22,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:22,385 INFO L87 Difference]: Start difference. First operand 12413 states and 13857 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 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-11 16:51:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:23,261 INFO L93 Difference]: Finished difference Result 29071 states and 32393 transitions. [2024-11-11 16:51:23,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:23,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 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 354 [2024-11-11 16:51:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:23,273 INFO L225 Difference]: With dead ends: 29071 [2024-11-11 16:51:23,273 INFO L226 Difference]: Without dead ends: 16103 [2024-11-11 16:51:23,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:23,281 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 289 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:23,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 368 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:51:23,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16103 states. [2024-11-11 16:51:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16103 to 10550. [2024-11-11 16:51:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10550 states, 10549 states have (on average 1.1117641482604985) internal successors, (11728), 10549 states have internal predecessors, (11728), 0 states have call successors, (0), 0 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-11 16:51:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10550 states to 10550 states and 11728 transitions. [2024-11-11 16:51:23,368 INFO L78 Accepts]: Start accepts. Automaton has 10550 states and 11728 transitions. Word has length 354 [2024-11-11 16:51:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:23,369 INFO L471 AbstractCegarLoop]: Abstraction has 10550 states and 11728 transitions. [2024-11-11 16:51:23,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 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-11 16:51:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 10550 states and 11728 transitions. [2024-11-11 16:51:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-11-11 16:51:23,373 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:23,374 INFO L218 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, 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] [2024-11-11 16:51:23,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 16:51:23,374 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:23,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:23,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1672122884, now seen corresponding path program 1 times [2024-11-11 16:51:23,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:23,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265368712] [2024-11-11 16:51:23,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:23,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-11 16:51:23,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:23,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265368712] [2024-11-11 16:51:23,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265368712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:23,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936197903] [2024-11-11 16:51:23,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:23,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:23,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:23,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:23,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:23,619 INFO L87 Difference]: Start difference. First operand 10550 states and 11728 transitions. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-11 16:51:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:24,202 INFO L93 Difference]: Finished difference Result 23312 states and 25815 transitions. [2024-11-11 16:51:24,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:24,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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 367 [2024-11-11 16:51:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:24,212 INFO L225 Difference]: With dead ends: 23312 [2024-11-11 16:51:24,212 INFO L226 Difference]: Without dead ends: 12764 [2024-11-11 16:51:24,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:24,217 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 312 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:24,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 57 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12764 states. [2024-11-11 16:51:24,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12764 to 10177. [2024-11-11 16:51:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10177 states, 10176 states have (on average 1.1077044025157232) internal successors, (11272), 10176 states have internal predecessors, (11272), 0 states have call successors, (0), 0 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-11 16:51:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10177 states to 10177 states and 11272 transitions. [2024-11-11 16:51:24,323 INFO L78 Accepts]: Start accepts. Automaton has 10177 states and 11272 transitions. Word has length 367 [2024-11-11 16:51:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:24,323 INFO L471 AbstractCegarLoop]: Abstraction has 10177 states and 11272 transitions. [2024-11-11 16:51:24,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-11 16:51:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 10177 states and 11272 transitions. [2024-11-11 16:51:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-11-11 16:51:24,328 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:24,328 INFO L218 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, 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] [2024-11-11 16:51:24,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 16:51:24,329 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:24,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:24,329 INFO L85 PathProgramCache]: Analyzing trace with hash 555394427, now seen corresponding path program 1 times [2024-11-11 16:51:24,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:24,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627272728] [2024-11-11 16:51:24,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:24,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-11 16:51:24,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:24,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627272728] [2024-11-11 16:51:24,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627272728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:24,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:24,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:24,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363023693] [2024-11-11 16:51:24,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:24,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:24,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:24,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:24,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:24,497 INFO L87 Difference]: Start difference. First operand 10177 states and 11272 transitions. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 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-11 16:51:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:25,267 INFO L93 Difference]: Finished difference Result 27179 states and 30081 transitions. [2024-11-11 16:51:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:25,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 402 [2024-11-11 16:51:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:25,281 INFO L225 Difference]: With dead ends: 27179 [2024-11-11 16:51:25,281 INFO L226 Difference]: Without dead ends: 17004 [2024-11-11 16:51:25,290 INFO L434 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-11 16:51:25,291 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 201 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:25,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 71 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:51:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17004 states. [2024-11-11 16:51:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17004 to 15891. [2024-11-11 16:51:25,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15891 states, 15890 states have (on average 1.1056639395846444) internal successors, (17569), 15890 states have internal predecessors, (17569), 0 states have call successors, (0), 0 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-11 16:51:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15891 states to 15891 states and 17569 transitions. [2024-11-11 16:51:25,418 INFO L78 Accepts]: Start accepts. Automaton has 15891 states and 17569 transitions. Word has length 402 [2024-11-11 16:51:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:25,418 INFO L471 AbstractCegarLoop]: Abstraction has 15891 states and 17569 transitions. [2024-11-11 16:51:25,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 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-11 16:51:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 15891 states and 17569 transitions. [2024-11-11 16:51:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2024-11-11 16:51:25,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:25,432 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:25,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 16:51:25,432 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:25,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:25,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1873288126, now seen corresponding path program 1 times [2024-11-11 16:51:25,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:25,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496525997] [2024-11-11 16:51:25,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:25,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-11 16:51:25,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:25,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496525997] [2024-11-11 16:51:25,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496525997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:25,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:25,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:25,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557286023] [2024-11-11 16:51:25,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:25,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:25,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:25,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:25,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:25,700 INFO L87 Difference]: Start difference. First operand 15891 states and 17569 transitions. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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-11 16:51:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:26,379 INFO L93 Difference]: Finished difference Result 30497 states and 33716 transitions. [2024-11-11 16:51:26,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:26,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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 547 [2024-11-11 16:51:26,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:26,393 INFO L225 Difference]: With dead ends: 30497 [2024-11-11 16:51:26,393 INFO L226 Difference]: Without dead ends: 17004 [2024-11-11 16:51:26,401 INFO L434 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-11 16:51:26,402 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 175 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:26,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 71 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:26,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17004 states. [2024-11-11 16:51:26,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17004 to 15707. [2024-11-11 16:51:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15707 states, 15706 states have (on average 1.1050553928434994) internal successors, (17356), 15706 states have internal predecessors, (17356), 0 states have call successors, (0), 0 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-11 16:51:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15707 states to 15707 states and 17356 transitions. [2024-11-11 16:51:26,519 INFO L78 Accepts]: Start accepts. Automaton has 15707 states and 17356 transitions. Word has length 547 [2024-11-11 16:51:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:26,519 INFO L471 AbstractCegarLoop]: Abstraction has 15707 states and 17356 transitions. [2024-11-11 16:51:26,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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-11 16:51:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 15707 states and 17356 transitions. [2024-11-11 16:51:26,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2024-11-11 16:51:26,531 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:26,531 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:26,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 16:51:26,531 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:26,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1519719464, now seen corresponding path program 1 times [2024-11-11 16:51:26,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:26,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231685077] [2024-11-11 16:51:26,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-11 16:51:26,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:26,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231685077] [2024-11-11 16:51:26,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231685077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:26,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:26,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:26,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127097180] [2024-11-11 16:51:26,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:26,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:26,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:26,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:26,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:26,758 INFO L87 Difference]: Start difference. First operand 15707 states and 17356 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 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-11 16:51:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:27,335 INFO L93 Difference]: Finished difference Result 29218 states and 32305 transitions. [2024-11-11 16:51:27,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:27,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 561 [2024-11-11 16:51:27,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:27,350 INFO L225 Difference]: With dead ends: 29218 [2024-11-11 16:51:27,350 INFO L226 Difference]: Without dead ends: 15725 [2024-11-11 16:51:27,358 INFO L434 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-11 16:51:27,359 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 102 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:27,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 160 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15725 states. [2024-11-11 16:51:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15725 to 15339. [2024-11-11 16:51:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15339 states, 15338 states have (on average 1.0973399400182553) internal successors, (16831), 15338 states have internal predecessors, (16831), 0 states have call successors, (0), 0 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-11 16:51:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15339 states to 15339 states and 16831 transitions. [2024-11-11 16:51:27,546 INFO L78 Accepts]: Start accepts. Automaton has 15339 states and 16831 transitions. Word has length 561 [2024-11-11 16:51:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:27,546 INFO L471 AbstractCegarLoop]: Abstraction has 15339 states and 16831 transitions. [2024-11-11 16:51:27,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 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-11 16:51:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 15339 states and 16831 transitions. [2024-11-11 16:51:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2024-11-11 16:51:27,564 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:27,564 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:27,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 16:51:27,564 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:27,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1808687197, now seen corresponding path program 1 times [2024-11-11 16:51:27,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:27,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276960949] [2024-11-11 16:51:27,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:27,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-11 16:51:27,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:27,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276960949] [2024-11-11 16:51:27,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276960949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:27,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:27,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:27,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460643632] [2024-11-11 16:51:27,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:27,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:27,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:27,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:27,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:27,824 INFO L87 Difference]: Start difference. First operand 15339 states and 16831 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 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-11 16:51:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:28,258 INFO L93 Difference]: Finished difference Result 31775 states and 34829 transitions. [2024-11-11 16:51:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:28,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 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 562 [2024-11-11 16:51:28,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:28,259 INFO L225 Difference]: With dead ends: 31775 [2024-11-11 16:51:28,259 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:51:28,269 INFO L434 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-11 16:51:28,270 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 101 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:28,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 127 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:51:28,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:51:28,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:51:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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-11 16:51:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:51:28,271 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 562 [2024-11-11 16:51:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:28,271 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:51:28,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 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-11 16:51:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:51:28,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:51:28,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:51:28,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 16:51:28,276 INFO L421 BasicCegarLoop]: Path program histogram: [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-11 16:51:28,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:51:33,864 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:51:33,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:51:33 BoogieIcfgContainer [2024-11-11 16:51:33,878 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:51:33,878 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:51:33,878 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:51:33,878 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:51:33,879 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:51:02" (3/4) ... [2024-11-11 16:51:33,880 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:51:33,899 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:51:33,900 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:51:33,901 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:51:33,902 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:51:34,015 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:51:34,016 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:51:34,016 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:51:34,019 INFO L158 Benchmark]: Toolchain (without parser) took 33650.39ms. Allocated memory was 153.1MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 118.2MB in the beginning and 920.8MB in the end (delta: -802.7MB). Peak memory consumption was 531.3MB. Max. memory is 16.1GB. [2024-11-11 16:51:34,019 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:51:34,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.24ms. Allocated memory is still 153.1MB. Free memory was 117.3MB in the beginning and 70.1MB in the end (delta: 47.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-11 16:51:34,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.11ms. Allocated memory is still 153.1MB. Free memory was 70.1MB in the beginning and 52.3MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 16:51:34,019 INFO L158 Benchmark]: Boogie Preprocessor took 167.59ms. Allocated memory is still 153.1MB. Free memory was 52.3MB in the beginning and 100.5MB in the end (delta: -48.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 16:51:34,020 INFO L158 Benchmark]: RCFGBuilder took 1287.65ms. Allocated memory was 153.1MB in the beginning and 228.6MB in the end (delta: 75.5MB). Free memory was 100.5MB in the beginning and 161.0MB in the end (delta: -60.5MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2024-11-11 16:51:34,020 INFO L158 Benchmark]: TraceAbstraction took 31419.77ms. Allocated memory was 228.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 160.0MB in the beginning and 937.6MB in the end (delta: -777.6MB). Peak memory consumption was 991.5MB. Max. memory is 16.1GB. [2024-11-11 16:51:34,020 INFO L158 Benchmark]: Witness Printer took 137.65ms. Allocated memory is still 1.5GB. Free memory was 937.6MB in the beginning and 920.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 16:51:34,021 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.24ms. Allocated memory is still 153.1MB. Free memory was 117.3MB in the beginning and 70.1MB in the end (delta: 47.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.11ms. Allocated memory is still 153.1MB. Free memory was 70.1MB in the beginning and 52.3MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 167.59ms. Allocated memory is still 153.1MB. Free memory was 52.3MB in the beginning and 100.5MB in the end (delta: -48.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1287.65ms. Allocated memory was 153.1MB in the beginning and 228.6MB in the end (delta: 75.5MB). Free memory was 100.5MB in the beginning and 161.0MB in the end (delta: -60.5MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. * TraceAbstraction took 31419.77ms. Allocated memory was 228.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 160.0MB in the beginning and 937.6MB in the end (delta: -777.6MB). Peak memory consumption was 991.5MB. Max. memory is 16.1GB. * Witness Printer took 137.65ms. Allocated memory is still 1.5GB. Free memory was 937.6MB in the beginning and 920.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 151]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.8s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4329 SdHoareTripleChecker+Valid, 14.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4329 mSDsluCounter, 4986 SdHoareTripleChecker+Invalid, 11.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 674 mSDsCounter, 2144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17194 IncrementalHoareTripleChecker+Invalid, 19338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2144 mSolverCounterUnsat, 4312 mSDtfsCounter, 17194 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 939 GetRequests, 897 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17789occurred in iteration=11, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 24702 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 7510 NumberOfCodeBlocks, 7510 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 7484 ConstructedInterpolants, 0 QuantifiedInterpolants, 23061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1222 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 26 InterpolantComputations, 23 PerfectInterpolantSequences, 7701/7924 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((a25 <= 10) && (a4 == 1)) && (312 <= a23)) && (a29 <= 130)) || (((((long long) a23 + 43) <= 0) && (a25 == 12)) && (a29 <= 220))) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || ((((307 <= a23) && (a29 <= 599999)) && (a4 == 1)) && (a25 == 10))) || (((((long long) a23 + 43) <= 0) && (a25 == 11)) && (a29 <= 130))) || (((a25 == 13) && (a29 <= 599999)) && (a4 == 1))) || ((((a29 <= 140) && (a4 == 0)) && (a23 <= 262)) && (a25 == 9))) || (((a4 == 0) && (a25 == 10)) && (a29 <= 130))) || (((a29 <= 275) && (a25 == 12)) && (a4 == 0))) || ((((a25 == 13) && (a4 == 0)) && (((long long) 35913 + a29) <= 0)) && (a23 <= 137))) || (((a29 <= 275) && (a4 == 1)) && (a25 == 10))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a29 <= 599999)) && (a25 == 9))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 11)) && (a29 <= 599999))) || ((((a29 <= 140) && (a4 == 0)) && (a23 <= 262)) && (a25 == 10))) || (((a25 == 12) && (a29 <= 599999)) && (a4 == 1))) || (((a25 == 11) && (a4 == 1)) && (a23 <= 137))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 599999)) && (a23 <= 137))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 275)) && (a4 == 0))) || ((((((((long long) a23 + 43) <= 0) && (((long long) a29 + 275824) <= 0)) && (a25 == 9)) || ((((a29 <= 275) && (a25 <= 10)) && (a23 <= 262)) && (a4 == 1))) || (((((long long) a23 + 43) <= 0) && (a25 <= 10)) && (a4 == 1))) && (a29 <= 599999))) || (((a29 <= 599999) && (a25 == 9)) && (a4 == 1))) || ((((a29 <= 275) && (a4 == 0)) && (a25 == 11)) && (a23 <= 262))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:51:34,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE