./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label26.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_label26.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 f464de24b3032dee99022ecd3bac09be4532608b487d4a13c374cca55e302076 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:49:20,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:49:20,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:49:20,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:49:20,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:49:20,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:49:20,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:49:20,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:49:20,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:49:20,533 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:49:20,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:49:20,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:49:20,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:49:20,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:49:20,538 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:49:20,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:49:20,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:49:20,539 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:49:20,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:49:20,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:49:20,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:49:20,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:49:20,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:49:20,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:49:20,545 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:49:20,545 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:49:20,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:49:20,545 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:49:20,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:49:20,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:49:20,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:49:20,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:49:20,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:49:20,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:49:20,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:49:20,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:49:20,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:49:20,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:49:20,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:49:20,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:49:20,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:49:20,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:49:20,551 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 -> f464de24b3032dee99022ecd3bac09be4532608b487d4a13c374cca55e302076 [2024-11-11 16:49:20,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:49:20,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:49:20,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:49:20,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:49:20,815 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:49:20,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label26.c [2024-11-11 16:49:22,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:49:22,630 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:49:22,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c [2024-11-11 16:49:22,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07854dcd1/b35c3acec6464bb4af5c5606ac8131f1/FLAG79206c91e [2024-11-11 16:49:22,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07854dcd1/b35c3acec6464bb4af5c5606ac8131f1 [2024-11-11 16:49:22,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:49:22,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:49:22,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:49:22,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:49:22,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:49:22,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:49:22" (1/1) ... [2024-11-11 16:49:22,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c8bdaf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:22, skipping insertion in model container [2024-11-11 16:49:22,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:49:22" (1/1) ... [2024-11-11 16:49:22,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:49:23,001 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_label26.c[5699,5712] [2024-11-11 16:49:23,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:49:23,258 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:49:23,280 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_label26.c[5699,5712] [2024-11-11 16:49:23,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:49:23,414 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:49:23,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:23 WrapperNode [2024-11-11 16:49:23,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:49:23,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:49:23,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:49:23,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:49:23,423 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:49:23" (1/1) ... [2024-11-11 16:49:23,447 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:49:23" (1/1) ... [2024-11-11 16:49:23,591 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-11 16:49:23,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:49:23,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:49:23,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:49:23,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:49:23,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:23" (1/1) ... [2024-11-11 16:49:23,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:23" (1/1) ... [2024-11-11 16:49:23,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:23" (1/1) ... [2024-11-11 16:49:23,671 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:49:23,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:23" (1/1) ... [2024-11-11 16:49:23,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:23" (1/1) ... [2024-11-11 16:49:23,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:23" (1/1) ... [2024-11-11 16:49:23,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:23" (1/1) ... [2024-11-11 16:49:23,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:23" (1/1) ... [2024-11-11 16:49:23,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:23" (1/1) ... [2024-11-11 16:49:23,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:49:23,770 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:49:23,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:49:23,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:49:23,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:23" (1/1) ... [2024-11-11 16:49:23,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:49:23,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:49:23,803 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:49:23,805 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:49:23,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:49:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:49:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:49:23,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:49:23,918 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:49:23,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:49:25,449 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-11 16:49:25,450 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:49:25,477 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:49:25,479 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:49:25,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:49:25 BoogieIcfgContainer [2024-11-11 16:49:25,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:49:25,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:49:25,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:49:25,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:49:25,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:49:22" (1/3) ... [2024-11-11 16:49:25,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c9948a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:49:25, skipping insertion in model container [2024-11-11 16:49:25,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:23" (2/3) ... [2024-11-11 16:49:25,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c9948a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:49:25, skipping insertion in model container [2024-11-11 16:49:25,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:49:25" (3/3) ... [2024-11-11 16:49:25,488 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label26.c [2024-11-11 16:49:25,504 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:49:25,505 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:49:25,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:49:25,587 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@40d053f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:49:25,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:49:25,592 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:49:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 16:49:25,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:25,602 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] [2024-11-11 16:49:25,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:25,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1453294289, now seen corresponding path program 1 times [2024-11-11 16:49:25,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:25,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872082333] [2024-11-11 16:49:25,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:25,982 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:49:25,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:25,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872082333] [2024-11-11 16:49:25,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872082333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:25,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:25,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:49:25,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655250867] [2024-11-11 16:49:25,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:25,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:25,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:26,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:26,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:26,022 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 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:49:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:27,115 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2024-11-11 16:49:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:27,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-11 16:49:27,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:27,129 INFO L225 Difference]: With dead ends: 776 [2024-11-11 16:49:27,129 INFO L226 Difference]: Without dead ends: 413 [2024-11-11 16:49:27,134 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:49:27,139 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 188 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:27,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:49:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-11 16:49:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2024-11-11 16:49:27,209 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:49:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2024-11-11 16:49:27,212 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 39 [2024-11-11 16:49:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:27,213 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2024-11-11 16:49:27,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:49:27,213 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2024-11-11 16:49:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-11 16:49:27,219 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:27,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:27,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:49:27,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:27,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:27,221 INFO L85 PathProgramCache]: Analyzing trace with hash 142001080, now seen corresponding path program 1 times [2024-11-11 16:49:27,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:27,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323990127] [2024-11-11 16:49:27,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:27,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:27,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:27,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323990127] [2024-11-11 16:49:27,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323990127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:27,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:27,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:49:27,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603966438] [2024-11-11 16:49:27,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:27,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:27,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:27,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:27,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:27,470 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:49:28,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:28,204 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2024-11-11 16:49:28,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:28,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-11-11 16:49:28,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:28,210 INFO L225 Difference]: With dead ends: 1209 [2024-11-11 16:49:28,210 INFO L226 Difference]: Without dead ends: 800 [2024-11-11 16:49:28,212 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:49:28,213 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 122 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.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:28,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 122 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-11 16:49:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2024-11-11 16:49:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3842239185750635) internal successors, (1088), 786 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states 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:49:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2024-11-11 16:49:28,251 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 107 [2024-11-11 16:49:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:28,252 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2024-11-11 16:49:28,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:49:28,253 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2024-11-11 16:49:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 16:49:28,256 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:28,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:28,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:49:28,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:28,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:28,261 INFO L85 PathProgramCache]: Analyzing trace with hash 412464125, now seen corresponding path program 1 times [2024-11-11 16:49:28,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:28,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519606528] [2024-11-11 16:49:28,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:28,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:28,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:28,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519606528] [2024-11-11 16:49:28,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519606528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:28,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:28,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:49:28,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896140639] [2024-11-11 16:49:28,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:28,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:28,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:28,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:28,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:28,607 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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:49:29,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:29,238 INFO L93 Difference]: Finished difference Result 1942 states and 2629 transitions. [2024-11-11 16:49:29,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:29,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-11-11 16:49:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:29,243 INFO L225 Difference]: With dead ends: 1942 [2024-11-11 16:49:29,244 INFO L226 Difference]: Without dead ends: 1157 [2024-11-11 16:49:29,245 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:49:29,246 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 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.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:29,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-11 16:49:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-11-11 16:49:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277056277056277) internal successors, (1475), 1155 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states 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:49:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2024-11-11 16:49:29,267 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 109 [2024-11-11 16:49:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:29,267 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2024-11-11 16:49:29,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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:49:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2024-11-11 16:49:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-11 16:49:29,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:29,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:29,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:49:29,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:29,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:29,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1192776204, now seen corresponding path program 1 times [2024-11-11 16:49:29,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:29,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181815139] [2024-11-11 16:49:29,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:29,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 16:49:29,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:29,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181815139] [2024-11-11 16:49:29,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181815139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:29,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:29,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:49:29,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930057986] [2024-11-11 16:49:29,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:29,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:29,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:29,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:29,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:29,494 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 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:49:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:30,257 INFO L93 Difference]: Finished difference Result 2502 states and 3336 transitions. [2024-11-11 16:49:30,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:30,258 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 151 [2024-11-11 16:49:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:30,265 INFO L225 Difference]: With dead ends: 2502 [2024-11-11 16:49:30,265 INFO L226 Difference]: Without dead ends: 1532 [2024-11-11 16:49:30,267 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:49:30,268 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:30,269 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.7s Time] [2024-11-11 16:49:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-11 16:49:30,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2024-11-11 16:49:30,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.2612671456564337) internal successors, (1931), 1531 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states 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:49:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1931 transitions. [2024-11-11 16:49:30,296 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1931 transitions. Word has length 151 [2024-11-11 16:49:30,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:30,297 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1931 transitions. [2024-11-11 16:49:30,298 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:49:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1931 transitions. [2024-11-11 16:49:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-11 16:49:30,300 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:30,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:30,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:49:30,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:30,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:30,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1825758429, now seen corresponding path program 1 times [2024-11-11 16:49:30,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:30,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247193457] [2024-11-11 16:49:30,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:30,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:30,536 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:30,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:30,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247193457] [2024-11-11 16:49:30,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247193457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:30,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:30,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:30,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979055637] [2024-11-11 16:49:30,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:30,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:30,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:30,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:30,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:30,562 INFO L87 Difference]: Start difference. First operand 1532 states and 1931 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:49:31,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:31,295 INFO L93 Difference]: Finished difference Result 3644 states and 4735 transitions. [2024-11-11 16:49:31,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:31,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2024-11-11 16:49:31,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:31,303 INFO L225 Difference]: With dead ends: 3644 [2024-11-11 16:49:31,304 INFO L226 Difference]: Without dead ends: 2298 [2024-11-11 16:49:31,306 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:49:31,307 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 196 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 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.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:31,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2024-11-11 16:49:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2295. [2024-11-11 16:49:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 2294 states have (on average 1.2650392327811684) internal successors, (2902), 2294 states have internal predecessors, (2902), 0 states have call successors, (0), 0 states 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:49:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2902 transitions. [2024-11-11 16:49:31,350 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2902 transitions. Word has length 166 [2024-11-11 16:49:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:31,350 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 2902 transitions. [2024-11-11 16:49:31,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:49:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2902 transitions. [2024-11-11 16:49:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-11 16:49:31,355 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:31,355 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:49:31,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:49:31,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:31,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash -890036000, now seen corresponding path program 1 times [2024-11-11 16:49:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:31,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143225795] [2024-11-11 16:49:31,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:31,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-11 16:49:31,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:31,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143225795] [2024-11-11 16:49:31,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143225795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:31,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:31,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:31,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695455303] [2024-11-11 16:49:31,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:31,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:31,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:31,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:31,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:31,690 INFO L87 Difference]: Start difference. First operand 2295 states and 2902 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states 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:49:32,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:32,377 INFO L93 Difference]: Finished difference Result 5509 states and 7126 transitions. [2024-11-11 16:49:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:32,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 221 [2024-11-11 16:49:32,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:32,390 INFO L225 Difference]: With dead ends: 5509 [2024-11-11 16:49:32,390 INFO L226 Difference]: Without dead ends: 3400 [2024-11-11 16:49:32,393 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:49:32,394 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 168 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:32,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 347 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2024-11-11 16:49:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3400. [2024-11-11 16:49:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3400 states, 3399 states have (on average 1.2350691379817593) internal successors, (4198), 3399 states have internal predecessors, (4198), 0 states have call successors, (0), 0 states 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:49:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4198 transitions. [2024-11-11 16:49:32,456 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4198 transitions. Word has length 221 [2024-11-11 16:49:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:32,458 INFO L471 AbstractCegarLoop]: Abstraction has 3400 states and 4198 transitions. [2024-11-11 16:49:32,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states 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:49:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4198 transitions. [2024-11-11 16:49:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-11 16:49:32,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:32,462 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:49:32,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:49:32,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:32,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1786639215, now seen corresponding path program 1 times [2024-11-11 16:49:32,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:32,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844868938] [2024-11-11 16:49:32,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:32,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-11 16:49:32,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:32,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844868938] [2024-11-11 16:49:32,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844868938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:32,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:32,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68944013] [2024-11-11 16:49:32,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:32,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:32,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:32,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:32,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:32,789 INFO L87 Difference]: Start difference. First operand 3400 states and 4198 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states 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:49:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:33,536 INFO L93 Difference]: Finished difference Result 7913 states and 9909 transitions. [2024-11-11 16:49:33,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:33,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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:49:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:33,551 INFO L225 Difference]: With dead ends: 7913 [2024-11-11 16:49:33,551 INFO L226 Difference]: Without dead ends: 4699 [2024-11-11 16:49:33,556 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:49:33,557 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 157 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:33,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 384 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:33,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2024-11-11 16:49:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 4689. [2024-11-11 16:49:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 4688 states have (on average 1.2137372013651877) internal successors, (5690), 4688 states have internal predecessors, (5690), 0 states have call successors, (0), 0 states 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:49:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 5690 transitions. [2024-11-11 16:49:33,653 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 5690 transitions. Word has length 227 [2024-11-11 16:49:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:33,654 INFO L471 AbstractCegarLoop]: Abstraction has 4689 states and 5690 transitions. [2024-11-11 16:49:33,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states 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:49:33,654 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 5690 transitions. [2024-11-11 16:49:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-11-11 16:49:33,660 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:33,661 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:33,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:49:33,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:33,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:33,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1830859079, now seen corresponding path program 1 times [2024-11-11 16:49:33,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:33,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019852483] [2024-11-11 16:49:33,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:33,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-11 16:49:33,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:33,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019852483] [2024-11-11 16:49:33,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019852483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:33,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:33,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:33,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206606715] [2024-11-11 16:49:33,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:33,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:33,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:33,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:33,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:33,983 INFO L87 Difference]: Start difference. First operand 4689 states and 5690 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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:49:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:34,786 INFO L93 Difference]: Finished difference Result 10682 states and 13136 transitions. [2024-11-11 16:49:34,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:34,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 298 [2024-11-11 16:49:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:34,808 INFO L225 Difference]: With dead ends: 10682 [2024-11-11 16:49:34,808 INFO L226 Difference]: Without dead ends: 6179 [2024-11-11 16:49:34,814 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:49:34,816 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:34,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 344 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2024-11-11 16:49:34,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 5978. [2024-11-11 16:49:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5978 states, 5977 states have (on average 1.2007696168646478) internal successors, (7177), 5977 states have internal predecessors, (7177), 0 states have call successors, (0), 0 states 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:49:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5978 states to 5978 states and 7177 transitions. [2024-11-11 16:49:34,910 INFO L78 Accepts]: Start accepts. Automaton has 5978 states and 7177 transitions. Word has length 298 [2024-11-11 16:49:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:34,910 INFO L471 AbstractCegarLoop]: Abstraction has 5978 states and 7177 transitions. [2024-11-11 16:49:34,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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:49:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 5978 states and 7177 transitions. [2024-11-11 16:49:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-11 16:49:34,917 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:34,918 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:34,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:49:34,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:34,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:34,919 INFO L85 PathProgramCache]: Analyzing trace with hash 719890930, now seen corresponding path program 1 times [2024-11-11 16:49:34,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:34,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569857738] [2024-11-11 16:49:34,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:34,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-11 16:49:35,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:35,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569857738] [2024-11-11 16:49:35,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569857738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:35,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:35,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:35,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619420551] [2024-11-11 16:49:35,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:35,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:35,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:35,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:35,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:35,132 INFO L87 Difference]: Start difference. First operand 5978 states and 7177 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states 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:49:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:35,854 INFO L93 Difference]: Finished difference Result 11739 states and 14076 transitions. [2024-11-11 16:49:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:35,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 301 [2024-11-11 16:49:35,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:35,878 INFO L225 Difference]: With dead ends: 11739 [2024-11-11 16:49:35,878 INFO L226 Difference]: Without dead ends: 5763 [2024-11-11 16:49:35,885 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:49:35,887 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 159 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:35,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 151 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:35,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5763 states. [2024-11-11 16:49:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5763 to 5578. [2024-11-11 16:49:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5578 states, 5577 states have (on average 1.1468531468531469) internal successors, (6396), 5577 states have internal predecessors, (6396), 0 states have call successors, (0), 0 states 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:49:35,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5578 states to 5578 states and 6396 transitions. [2024-11-11 16:49:35,971 INFO L78 Accepts]: Start accepts. Automaton has 5578 states and 6396 transitions. Word has length 301 [2024-11-11 16:49:35,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:35,971 INFO L471 AbstractCegarLoop]: Abstraction has 5578 states and 6396 transitions. [2024-11-11 16:49:35,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states 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:49:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 5578 states and 6396 transitions. [2024-11-11 16:49:35,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-11-11 16:49:35,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:35,982 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:49:35,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:49:35,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:35,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:35,983 INFO L85 PathProgramCache]: Analyzing trace with hash 142462327, now seen corresponding path program 1 times [2024-11-11 16:49:35,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:35,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126352037] [2024-11-11 16:49:35,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:35,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-11 16:49:36,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:36,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126352037] [2024-11-11 16:49:36,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126352037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:36,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:36,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:49:36,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207861751] [2024-11-11 16:49:36,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:36,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:36,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:36,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:36,346 INFO L87 Difference]: Start difference. First operand 5578 states and 6396 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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:49:36,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:36,740 INFO L93 Difference]: Finished difference Result 11150 states and 12786 transitions. [2024-11-11 16:49:36,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:36,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 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 379 [2024-11-11 16:49:36,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:36,767 INFO L225 Difference]: With dead ends: 11150 [2024-11-11 16:49:36,767 INFO L226 Difference]: Without dead ends: 5574 [2024-11-11 16:49:36,777 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:49:36,778 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 216 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:36,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 39 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:49:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5574 states. [2024-11-11 16:49:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5574 to 5574. [2024-11-11 16:49:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5574 states, 5573 states have (on average 1.1462408038758298) internal successors, (6388), 5573 states have internal predecessors, (6388), 0 states have call successors, (0), 0 states 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:49:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5574 states to 5574 states and 6388 transitions. [2024-11-11 16:49:36,868 INFO L78 Accepts]: Start accepts. Automaton has 5574 states and 6388 transitions. Word has length 379 [2024-11-11 16:49:36,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:36,869 INFO L471 AbstractCegarLoop]: Abstraction has 5574 states and 6388 transitions. [2024-11-11 16:49:36,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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:49:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 5574 states and 6388 transitions. [2024-11-11 16:49:36,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2024-11-11 16:49:36,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:36,888 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:49:36,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:49:36,889 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:36,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:36,890 INFO L85 PathProgramCache]: Analyzing trace with hash -180803510, now seen corresponding path program 1 times [2024-11-11 16:49:36,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:36,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196478521] [2024-11-11 16:49:36,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:36,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-11 16:49:37,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:37,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196478521] [2024-11-11 16:49:37,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196478521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:37,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:37,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:37,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110393264] [2024-11-11 16:49:37,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:37,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:37,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:37,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:37,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:37,364 INFO L87 Difference]: Start difference. First operand 5574 states and 6388 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states 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:49:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:38,031 INFO L93 Difference]: Finished difference Result 12632 states and 14466 transitions. [2024-11-11 16:49:38,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:38,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 411 [2024-11-11 16:49:38,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:38,042 INFO L225 Difference]: With dead ends: 12632 [2024-11-11 16:49:38,043 INFO L226 Difference]: Without dead ends: 7060 [2024-11-11 16:49:38,048 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:49:38,048 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 67 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:38,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 179 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:38,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7060 states. [2024-11-11 16:49:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7060 to 6862. [2024-11-11 16:49:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6862 states, 6861 states have (on average 1.1380265267453724) internal successors, (7808), 6861 states have internal predecessors, (7808), 0 states have call successors, (0), 0 states 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:49:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6862 states to 6862 states and 7808 transitions. [2024-11-11 16:49:38,130 INFO L78 Accepts]: Start accepts. Automaton has 6862 states and 7808 transitions. Word has length 411 [2024-11-11 16:49:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:38,131 INFO L471 AbstractCegarLoop]: Abstraction has 6862 states and 7808 transitions. [2024-11-11 16:49:38,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states 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:49:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 6862 states and 7808 transitions. [2024-11-11 16:49:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2024-11-11 16:49:38,148 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:38,148 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:49:38,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:49:38,149 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:38,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1611250862, now seen corresponding path program 1 times [2024-11-11 16:49:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:38,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831374602] [2024-11-11 16:49:38,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:38,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-11 16:49:38,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:38,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831374602] [2024-11-11 16:49:38,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831374602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:38,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:38,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:38,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131229726] [2024-11-11 16:49:38,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:38,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:38,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:38,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:38,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:38,452 INFO L87 Difference]: Start difference. First operand 6862 states and 7808 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states 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:49:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:39,143 INFO L93 Difference]: Finished difference Result 15929 states and 18169 transitions. [2024-11-11 16:49:39,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:39,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 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 463 [2024-11-11 16:49:39,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:39,159 INFO L225 Difference]: With dead ends: 15929 [2024-11-11 16:49:39,159 INFO L226 Difference]: Without dead ends: 8517 [2024-11-11 16:49:39,166 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:49:39,167 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 64 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:39,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 351 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8517 states. [2024-11-11 16:49:39,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8517 to 8333. [2024-11-11 16:49:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8333 states, 8332 states have (on average 1.1331012962073932) internal successors, (9441), 8332 states have internal predecessors, (9441), 0 states have call successors, (0), 0 states 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:49:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8333 states to 8333 states and 9441 transitions. [2024-11-11 16:49:39,266 INFO L78 Accepts]: Start accepts. Automaton has 8333 states and 9441 transitions. Word has length 463 [2024-11-11 16:49:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:39,267 INFO L471 AbstractCegarLoop]: Abstraction has 8333 states and 9441 transitions. [2024-11-11 16:49:39,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states 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:49:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 8333 states and 9441 transitions. [2024-11-11 16:49:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2024-11-11 16:49:39,282 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:39,282 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-11 16:49:39,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:49:39,283 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:39,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:39,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2033522650, now seen corresponding path program 1 times [2024-11-11 16:49:39,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:39,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875386419] [2024-11-11 16:49:39,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:39,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-11-11 16:49:39,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:39,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875386419] [2024-11-11 16:49:39,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875386419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:39,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:39,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:39,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393205275] [2024-11-11 16:49:39,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:39,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:39,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:39,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:39,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:39,811 INFO L87 Difference]: Start difference. First operand 8333 states and 9441 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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:49:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:40,483 INFO L93 Difference]: Finished difference Result 19072 states and 21665 transitions. [2024-11-11 16:49:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:40,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 499 [2024-11-11 16:49:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:40,501 INFO L225 Difference]: With dead ends: 19072 [2024-11-11 16:49:40,501 INFO L226 Difference]: Without dead ends: 10741 [2024-11-11 16:49:40,507 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:49:40,508 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 139 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:40,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 134 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10741 states. [2024-11-11 16:49:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10741 to 10553. [2024-11-11 16:49:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10553 states, 10552 states have (on average 1.1254738438210765) internal successors, (11876), 10552 states have internal predecessors, (11876), 0 states have call successors, (0), 0 states 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:49:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10553 states to 10553 states and 11876 transitions. [2024-11-11 16:49:40,632 INFO L78 Accepts]: Start accepts. Automaton has 10553 states and 11876 transitions. Word has length 499 [2024-11-11 16:49:40,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:40,632 INFO L471 AbstractCegarLoop]: Abstraction has 10553 states and 11876 transitions. [2024-11-11 16:49:40,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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:49:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 10553 states and 11876 transitions. [2024-11-11 16:49:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2024-11-11 16:49:40,648 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:40,649 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:40,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 16:49:40,649 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:40,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1343348106, now seen corresponding path program 1 times [2024-11-11 16:49:40,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:40,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234774723] [2024-11-11 16:49:40,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-11 16:49:41,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234774723] [2024-11-11 16:49:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234774723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:41,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:41,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772385718] [2024-11-11 16:49:41,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:41,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:41,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:41,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:41,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:41,111 INFO L87 Difference]: Start difference. First operand 10553 states and 11876 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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:49:41,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:41,842 INFO L93 Difference]: Finished difference Result 24419 states and 27484 transitions. [2024-11-11 16:49:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:41,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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 503 [2024-11-11 16:49:41,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:41,865 INFO L225 Difference]: With dead ends: 24419 [2024-11-11 16:49:41,865 INFO L226 Difference]: Without dead ends: 13868 [2024-11-11 16:49:41,877 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:49:41,878 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 125 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:41,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 79 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13868 states. [2024-11-11 16:49:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13868 to 13121. [2024-11-11 16:49:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13121 states, 13120 states have (on average 1.118216463414634) internal successors, (14671), 13120 states have internal predecessors, (14671), 0 states have call successors, (0), 0 states 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:49:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13121 states to 13121 states and 14671 transitions. [2024-11-11 16:49:42,104 INFO L78 Accepts]: Start accepts. Automaton has 13121 states and 14671 transitions. Word has length 503 [2024-11-11 16:49:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:42,104 INFO L471 AbstractCegarLoop]: Abstraction has 13121 states and 14671 transitions. [2024-11-11 16:49:42,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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:49:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 13121 states and 14671 transitions. [2024-11-11 16:49:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2024-11-11 16:49:42,121 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:42,121 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:42,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 16:49:42,122 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:42,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash 101919231, now seen corresponding path program 1 times [2024-11-11 16:49:42,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:42,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848813985] [2024-11-11 16:49:42,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:42,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 228 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-11 16:49:43,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:43,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848813985] [2024-11-11 16:49:43,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848813985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:49:43,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107840153] [2024-11-11 16:49:43,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:43,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:49:43,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:49:43,687 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:49:43,688 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:49:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:43,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:49:43,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:49:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-11 16:49:44,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:49:44,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107840153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:44,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:49:44,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-11 16:49:44,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814958512] [2024-11-11 16:49:44,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:44,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:44,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:44,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:44,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:49:44,121 INFO L87 Difference]: Start difference. First operand 13121 states and 14671 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:49:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:44,778 INFO L93 Difference]: Finished difference Result 15147 states and 16897 transitions. [2024-11-11 16:49:44,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:44,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 509 [2024-11-11 16:49:44,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:44,803 INFO L225 Difference]: With dead ends: 15147 [2024-11-11 16:49:44,803 INFO L226 Difference]: Without dead ends: 15145 [2024-11-11 16:49:44,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:49:44,811 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 182 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:44,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 137 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15145 states. [2024-11-11 16:49:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15145 to 13121. [2024-11-11 16:49:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13121 states, 13120 states have (on average 1.118140243902439) internal successors, (14670), 13120 states have internal predecessors, (14670), 0 states have call successors, (0), 0 states 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:49:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13121 states to 13121 states and 14670 transitions. [2024-11-11 16:49:45,044 INFO L78 Accepts]: Start accepts. Automaton has 13121 states and 14670 transitions. Word has length 509 [2024-11-11 16:49:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:45,044 INFO L471 AbstractCegarLoop]: Abstraction has 13121 states and 14670 transitions. [2024-11-11 16:49:45,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:49:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 13121 states and 14670 transitions. [2024-11-11 16:49:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2024-11-11 16:49:45,064 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:45,065 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-11 16:49:45,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 16:49:45,265 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,SelfDestructingSolverStorable14 [2024-11-11 16:49:45,266 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:45,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash -465150684, now seen corresponding path program 1 times [2024-11-11 16:49:45,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:45,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836305270] [2024-11-11 16:49:45,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:45,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 630 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-11 16:49:45,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:45,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836305270] [2024-11-11 16:49:45,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836305270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:45,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:45,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:45,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942851761] [2024-11-11 16:49:45,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:45,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:49:45,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:45,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:49:45,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:45,723 INFO L87 Difference]: Start difference. First operand 13121 states and 14670 transitions. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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:49:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:46,828 INFO L93 Difference]: Finished difference Result 34169 states and 37973 transitions. [2024-11-11 16:49:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:49:46,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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 575 [2024-11-11 16:49:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:46,851 INFO L225 Difference]: With dead ends: 34169 [2024-11-11 16:49:46,851 INFO L226 Difference]: Without dead ends: 21050 [2024-11-11 16:49:46,864 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:49:46,865 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 160 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:46,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 67 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:49:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21050 states. [2024-11-11 16:49:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21050 to 19571. [2024-11-11 16:49:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19571 states, 19570 states have (on average 1.1077669902912621) internal successors, (21679), 19570 states have internal predecessors, (21679), 0 states have call successors, (0), 0 states 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:49:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19571 states to 19571 states and 21679 transitions. [2024-11-11 16:49:47,111 INFO L78 Accepts]: Start accepts. Automaton has 19571 states and 21679 transitions. Word has length 575 [2024-11-11 16:49:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:47,112 INFO L471 AbstractCegarLoop]: Abstraction has 19571 states and 21679 transitions. [2024-11-11 16:49:47,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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:49:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 19571 states and 21679 transitions. [2024-11-11 16:49:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2024-11-11 16:49:47,135 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:47,135 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, 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, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:47,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 16:49:47,136 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:47,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:47,138 INFO L85 PathProgramCache]: Analyzing trace with hash -2090442296, now seen corresponding path program 1 times [2024-11-11 16:49:47,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:47,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800895291] [2024-11-11 16:49:47,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:47,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 527 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2024-11-11 16:49:47,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:47,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800895291] [2024-11-11 16:49:47,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800895291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:47,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:47,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:47,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99857826] [2024-11-11 16:49:47,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:47,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:47,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:47,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:47,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:47,532 INFO L87 Difference]: Start difference. First operand 19571 states and 21679 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:49:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:48,310 INFO L93 Difference]: Finished difference Result 39320 states and 43587 transitions. [2024-11-11 16:49:48,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:48,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 626 [2024-11-11 16:49:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:48,338 INFO L225 Difference]: With dead ends: 39320 [2024-11-11 16:49:48,338 INFO L226 Difference]: Without dead ends: 22331 [2024-11-11 16:49:48,354 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:49:48,355 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 146 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:48,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 112 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:48,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22331 states. [2024-11-11 16:49:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22331 to 19939. [2024-11-11 16:49:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19939 states, 19938 states have (on average 1.1019660948941719) internal successors, (21971), 19938 states have internal predecessors, (21971), 0 states have call successors, (0), 0 states 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:49:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19939 states to 19939 states and 21971 transitions. [2024-11-11 16:49:48,672 INFO L78 Accepts]: Start accepts. Automaton has 19939 states and 21971 transitions. Word has length 626 [2024-11-11 16:49:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:48,673 INFO L471 AbstractCegarLoop]: Abstraction has 19939 states and 21971 transitions. [2024-11-11 16:49:48,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:49:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 19939 states and 21971 transitions. [2024-11-11 16:49:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2024-11-11 16:49:48,704 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:48,704 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, 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, 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, 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, 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:49:48,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 16:49:48,705 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:48,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1352424580, now seen corresponding path program 1 times [2024-11-11 16:49:48,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:48,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205698894] [2024-11-11 16:49:48,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:48,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 527 proven. 0 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2024-11-11 16:49:49,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:49,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205698894] [2024-11-11 16:49:49,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205698894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:49,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:49,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:49,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264782688] [2024-11-11 16:49:49,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:49,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:49,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:49,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:49,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:49,009 INFO L87 Difference]: Start difference. First operand 19939 states and 21971 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states 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:49:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:49,628 INFO L93 Difference]: Finished difference Result 40795 states and 44946 transitions. [2024-11-11 16:49:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:49,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 659 [2024-11-11 16:49:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:49,646 INFO L225 Difference]: With dead ends: 40795 [2024-11-11 16:49:49,646 INFO L226 Difference]: Without dead ends: 21226 [2024-11-11 16:49:49,658 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:49:49,658 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 115 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:49,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 137 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:49:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21226 states. [2024-11-11 16:49:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21226 to 19193. [2024-11-11 16:49:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19193 states, 19192 states have (on average 1.0982180075031263) internal successors, (21077), 19192 states have internal predecessors, (21077), 0 states have call successors, (0), 0 states 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:49:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19193 states to 19193 states and 21077 transitions. [2024-11-11 16:49:49,865 INFO L78 Accepts]: Start accepts. Automaton has 19193 states and 21077 transitions. Word has length 659 [2024-11-11 16:49:49,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:49,866 INFO L471 AbstractCegarLoop]: Abstraction has 19193 states and 21077 transitions. [2024-11-11 16:49:49,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states 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:49:49,866 INFO L276 IsEmpty]: Start isEmpty. Operand 19193 states and 21077 transitions. [2024-11-11 16:49:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2024-11-11 16:49:49,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:49,886 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 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:49:49,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 16:49:49,887 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:49,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:49,887 INFO L85 PathProgramCache]: Analyzing trace with hash -58290927, now seen corresponding path program 1 times [2024-11-11 16:49:49,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:49,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870255096] [2024-11-11 16:49:49,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:49,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 1039 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2024-11-11 16:49:50,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:50,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870255096] [2024-11-11 16:49:50,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870255096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:50,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:50,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:50,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106444684] [2024-11-11 16:49:50,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:50,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:50,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:50,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:50,306 INFO L87 Difference]: Start difference. First operand 19193 states and 21077 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states 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:49:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:50,948 INFO L93 Difference]: Finished difference Result 36909 states and 40477 transitions. [2024-11-11 16:49:50,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:50,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 708 [2024-11-11 16:49:50,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:50,950 INFO L225 Difference]: With dead ends: 36909 [2024-11-11 16:49:50,950 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:49:50,965 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:49:50,965 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 46 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:50,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 338 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:49:50,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:49:50,966 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:49:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:49:50,966 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 708 [2024-11-11 16:49:50,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:50,967 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:49:50,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states 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:49:50,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:49:50,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:49:50,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:49:50,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 16:49:50,972 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] [2024-11-11 16:49:50,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:49:53,793 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:49:53,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:49:53 BoogieIcfgContainer [2024-11-11 16:49:53,817 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:49:53,818 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:49:53,818 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:49:53,818 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:49:53,818 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:49:25" (3/4) ... [2024-11-11 16:49:53,821 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:49:53,851 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:49:53,852 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:49:53,853 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:49:53,854 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:49:54,019 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:49:54,020 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:49:54,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:49:54,021 INFO L158 Benchmark]: Toolchain (without parser) took 31351.83ms. Allocated memory was 148.9MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 93.0MB in the beginning and 984.9MB in the end (delta: -891.9MB). Peak memory consumption was 669.0MB. Max. memory is 16.1GB. [2024-11-11 16:49:54,021 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 148.9MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:49:54,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 744.11ms. Allocated memory is still 148.9MB. Free memory was 93.0MB in the beginning and 44.7MB in the end (delta: 48.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-11 16:49:54,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 176.34ms. Allocated memory was 148.9MB in the beginning and 205.5MB in the end (delta: 56.6MB). Free memory was 44.7MB in the beginning and 160.5MB in the end (delta: -115.8MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-11 16:49:54,022 INFO L158 Benchmark]: Boogie Preprocessor took 176.01ms. Allocated memory is still 205.5MB. Free memory was 160.5MB in the beginning and 134.4MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 16:49:54,022 INFO L158 Benchmark]: RCFGBuilder took 1710.28ms. Allocated memory is still 205.5MB. Free memory was 134.4MB in the beginning and 134.0MB in the end (delta: 470.1kB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. [2024-11-11 16:49:54,022 INFO L158 Benchmark]: TraceAbstraction took 28335.42ms. Allocated memory was 205.5MB in the beginning and 1.1GB in the end (delta: 872.4MB). Free memory was 132.9MB in the beginning and 360.0MB in the end (delta: -227.0MB). Peak memory consumption was 681.5MB. Max. memory is 16.1GB. [2024-11-11 16:49:54,023 INFO L158 Benchmark]: Witness Printer took 202.47ms. Allocated memory is still 1.1GB. Free memory was 358.9MB in the beginning and 984.9MB in the end (delta: -626.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 16:49:54,024 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.15ms. Allocated memory is still 148.9MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 744.11ms. Allocated memory is still 148.9MB. Free memory was 93.0MB in the beginning and 44.7MB in the end (delta: 48.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 176.34ms. Allocated memory was 148.9MB in the beginning and 205.5MB in the end (delta: 56.6MB). Free memory was 44.7MB in the beginning and 160.5MB in the end (delta: -115.8MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 176.01ms. Allocated memory is still 205.5MB. Free memory was 160.5MB in the beginning and 134.4MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1710.28ms. Allocated memory is still 205.5MB. Free memory was 134.4MB in the beginning and 134.0MB in the end (delta: 470.1kB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. * TraceAbstraction took 28335.42ms. Allocated memory was 205.5MB in the beginning and 1.1GB in the end (delta: 872.4MB). Free memory was 132.9MB in the beginning and 360.0MB in the end (delta: -227.0MB). Peak memory consumption was 681.5MB. Max. memory is 16.1GB. * Witness Printer took 202.47ms. Allocated memory is still 1.1GB. Free memory was 358.9MB in the beginning and 984.9MB in the end (delta: -626.0MB). Peak memory consumption was 4.2MB. 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: 133]: 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.4s, OverallIterations: 19, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2632 SdHoareTripleChecker+Valid, 12.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2632 mSDsluCounter, 3785 SdHoareTripleChecker+Invalid, 10.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 391 mSDsCounter, 1702 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10597 IncrementalHoareTripleChecker+Invalid, 12299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1702 mSolverCounterUnsat, 3394 mSDtfsCounter, 10597 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19939occurred in iteration=17, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 9660 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 7460 NumberOfCodeBlocks, 7460 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 7440 ConstructedInterpolants, 0 QuantifiedInterpolants, 14332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 674 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 10110/10516 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 == 11) && (a8 <= 15)) && (a4 == 1)) && (246 <= a29)) && (0 <= ((long long) a23 + 42))) || (((a25 == 12) && (a4 == 0)) && (a8 <= 15))) || (((((a25 == 11) && (a29 <= 274)) && (a8 <= 15)) && (a4 == 1)) && (246 <= a29))) || ((((((a29 <= 140) && (a4 == 0)) && (a25 <= 10)) && (a8 <= 15)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 13) && (139 <= a23)) && (a8 <= 15)) && (a4 == 1))) || ((((a25 == 12) && (a8 <= 15)) && (a4 == 1)) && (a29 <= 130))) || ((((a25 == 12) && (139 <= a23)) && (a8 <= 15)) && (a4 == 1))) || (((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) && (a8 <= 15)) && (a23 <= 312))) || (((((a25 == 11) && (139 <= a23)) && (a8 <= 15)) && (a4 == 1)) && (a23 <= 312))) || (((a25 <= 10) && (a8 <= 15)) && (a4 == 1))) || (((((a25 == 13) && (a4 == 0)) && (a8 <= 15)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || ((((a4 == 0) && (a8 <= 15)) && (a25 == 10)) && (a29 <= 130))) || (((((a25 == 11) && (a8 <= 15)) && (a29 <= 220)) && (a4 == 1)) && (312 <= a23))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a8 <= 15)) && (246 <= a29))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a8 <= 15)) && (a29 <= 130))) || ((((a25 == 13) && (a29 <= 274)) && (a8 <= 15)) && (a4 == 1))) || (((((a4 == 0) && (a25 == 11)) && (a8 <= 15)) && (a23 <= 312)) && (246 <= a29))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:49:54,057 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