./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label18.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label18.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 8fcc4bb7cd8f204722096b247511c17cd0d430fd3f99523a22a5bf87d5e044f6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:36:20,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:36:20,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:36:20,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:36:20,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:36:20,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:36:20,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:36:20,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:36:20,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:36:20,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:36:20,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:36:20,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:36:20,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:36:20,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:36:20,390 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:36:20,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:36:20,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:36:20,393 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:36:20,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:36:20,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:36:20,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:36:20,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:36:20,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:36:20,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:36:20,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:36:20,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:36:20,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:36:20,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:36:20,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:36:20,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:36:20,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:36:20,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:36:20,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:36:20,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:36:20,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:36:20,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:36:20,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:36:20,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:36:20,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:36:20,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:36:20,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:36:20,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:36:20,404 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 -> 8fcc4bb7cd8f204722096b247511c17cd0d430fd3f99523a22a5bf87d5e044f6 [2024-11-09 18:36:20,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:36:20,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:36:20,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:36:20,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:36:20,705 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:36:20,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2024-11-09 18:36:22,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:36:22,535 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:36:22,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2024-11-09 18:36:22,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3a3b38e/16f83776ae8a4932b21ca7fe86e196b9/FLAG8455b4454 [2024-11-09 18:36:22,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3a3b38e/16f83776ae8a4932b21ca7fe86e196b9 [2024-11-09 18:36:22,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:36:22,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:36:22,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:36:22,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:36:22,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:36:22,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:36:22" (1/1) ... [2024-11-09 18:36:22,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d1149c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:22, skipping insertion in model container [2024-11-09 18:36:22,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:36:22" (1/1) ... [2024-11-09 18:36:22,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:36:22,957 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/Problem01_label18.c[17985,17998] [2024-11-09 18:36:23,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:36:23,025 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:36:23,080 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/Problem01_label18.c[17985,17998] [2024-11-09 18:36:23,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:36:23,111 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:36:23,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:23 WrapperNode [2024-11-09 18:36:23,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:36:23,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:36:23,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:36:23,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:36:23,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:23" (1/1) ... [2024-11-09 18:36:23,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:23" (1/1) ... [2024-11-09 18:36:23,227 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-09 18:36:23,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:36:23,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:36:23,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:36:23,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:36:23,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:23" (1/1) ... [2024-11-09 18:36:23,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:23" (1/1) ... [2024-11-09 18:36:23,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:23" (1/1) ... [2024-11-09 18:36:23,297 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 18:36:23,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:23" (1/1) ... [2024-11-09 18:36:23,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:23" (1/1) ... [2024-11-09 18:36:23,327 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:23" (1/1) ... [2024-11-09 18:36:23,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:23" (1/1) ... [2024-11-09 18:36:23,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:23" (1/1) ... [2024-11-09 18:36:23,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:23" (1/1) ... [2024-11-09 18:36:23,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:36:23,344 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:36:23,344 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:36:23,344 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:36:23,345 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:23" (1/1) ... [2024-11-09 18:36:23,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:36:23,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:36:23,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 18:36:23,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 18:36:23,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:36:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:36:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:36:23,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:36:23,518 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:36:23,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:36:24,505 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-09 18:36:24,506 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:36:24,535 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:36:24,537 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:36:24,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:36:24 BoogieIcfgContainer [2024-11-09 18:36:24,538 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:36:24,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:36:24,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:36:24,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:36:24,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:36:22" (1/3) ... [2024-11-09 18:36:24,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614184c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:36:24, skipping insertion in model container [2024-11-09 18:36:24,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:23" (2/3) ... [2024-11-09 18:36:24,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614184c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:36:24, skipping insertion in model container [2024-11-09 18:36:24,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:36:24" (3/3) ... [2024-11-09 18:36:24,548 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label18.c [2024-11-09 18:36:24,565 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:36:24,567 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:36:24,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:36:24,649 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;@5cc60d9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:36:24,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:36:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 199 states have (on average 1.6582914572864322) internal successors, (330), 200 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 18:36:24,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:24,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:24,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:24,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:24,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1738332183, now seen corresponding path program 1 times [2024-11-09 18:36:24,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:24,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543751283] [2024-11-09 18:36:24,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:24,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:25,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:25,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543751283] [2024-11-09 18:36:25,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543751283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:25,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:25,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:25,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502010036] [2024-11-09 18:36:25,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:25,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:25,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:25,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:25,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:25,176 INFO L87 Difference]: Start difference. First operand has 201 states, 199 states have (on average 1.6582914572864322) internal successors, (330), 200 states have internal predecessors, (330), 0 states have call successors, (0), 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 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:25,818 INFO L93 Difference]: Finished difference Result 534 states and 921 transitions. [2024-11-09 18:36:25,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:25,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-11-09 18:36:25,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:25,834 INFO L225 Difference]: With dead ends: 534 [2024-11-09 18:36:25,834 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 18:36:25,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:25,845 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 82 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:25,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 77 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 18:36:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 18:36:25,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-09 18:36:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.4067164179104477) internal successors, (377), 268 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 377 transitions. [2024-11-09 18:36:25,903 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 377 transitions. Word has length 102 [2024-11-09 18:36:25,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:25,904 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 377 transitions. [2024-11-09 18:36:25,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:25,904 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 377 transitions. [2024-11-09 18:36:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 18:36:25,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:25,907 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:25,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:36:25,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:25,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:25,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1618489452, now seen corresponding path program 1 times [2024-11-09 18:36:25,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:25,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039658422] [2024-11-09 18:36:25,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:25,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:26,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:26,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039658422] [2024-11-09 18:36:26,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039658422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:26,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:26,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:36:26,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324977274] [2024-11-09 18:36:26,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:26,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:26,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:26,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:26,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:26,131 INFO L87 Difference]: Start difference. First operand 269 states and 377 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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-09 18:36:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:26,586 INFO L93 Difference]: Finished difference Result 800 states and 1125 transitions. [2024-11-09 18:36:26,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:26,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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-09 18:36:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:26,593 INFO L225 Difference]: With dead ends: 800 [2024-11-09 18:36:26,593 INFO L226 Difference]: Without dead ends: 533 [2024-11-09 18:36:26,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:26,595 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:26,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-09 18:36:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2024-11-09 18:36:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.3402255639097744) internal successors, (713), 532 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 713 transitions. [2024-11-09 18:36:26,634 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 713 transitions. Word has length 107 [2024-11-09 18:36:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:26,635 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 713 transitions. [2024-11-09 18:36:26,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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-09 18:36:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 713 transitions. [2024-11-09 18:36:26,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 18:36:26,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:26,641 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-11-09 18:36:26,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:36:26,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:26,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:26,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1203733343, now seen corresponding path program 1 times [2024-11-09 18:36:26,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:26,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247340124] [2024-11-09 18:36:26,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:26,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 18:36:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:26,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247340124] [2024-11-09 18:36:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247340124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:26,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:26,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:26,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108860044] [2024-11-09 18:36:26,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:26,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:26,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:26,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:26,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:26,776 INFO L87 Difference]: Start difference. First operand 533 states and 713 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:27,121 INFO L93 Difference]: Finished difference Result 1328 states and 1797 transitions. [2024-11-09 18:36:27,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:27,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 127 [2024-11-09 18:36:27,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:27,125 INFO L225 Difference]: With dead ends: 1328 [2024-11-09 18:36:27,125 INFO L226 Difference]: Without dead ends: 797 [2024-11-09 18:36:27,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:27,127 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 160 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:27,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 32 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:36:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-09 18:36:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 665. [2024-11-09 18:36:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.3463855421686748) internal successors, (894), 664 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 894 transitions. [2024-11-09 18:36:27,154 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 894 transitions. Word has length 127 [2024-11-09 18:36:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:27,154 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 894 transitions. [2024-11-09 18:36:27,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 894 transitions. [2024-11-09 18:36:27,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 18:36:27,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:27,158 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 18:36:27,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:36:27,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:27,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:27,160 INFO L85 PathProgramCache]: Analyzing trace with hash -119719573, now seen corresponding path program 1 times [2024-11-09 18:36:27,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:27,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608890611] [2024-11-09 18:36:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:27,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 18:36:27,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:27,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608890611] [2024-11-09 18:36:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608890611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:27,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:27,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:27,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755542536] [2024-11-09 18:36:27,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:27,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:27,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:27,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:27,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:27,392 INFO L87 Difference]: Start difference. First operand 665 states and 894 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:27,751 INFO L93 Difference]: Finished difference Result 1328 states and 1786 transitions. [2024-11-09 18:36:27,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:27,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 131 [2024-11-09 18:36:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:27,755 INFO L225 Difference]: With dead ends: 1328 [2024-11-09 18:36:27,755 INFO L226 Difference]: Without dead ends: 665 [2024-11-09 18:36:27,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:27,760 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 132 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:27,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 66 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:36:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-09 18:36:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2024-11-09 18:36:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.3373493975903614) internal successors, (888), 664 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 888 transitions. [2024-11-09 18:36:27,777 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 888 transitions. Word has length 131 [2024-11-09 18:36:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:27,777 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 888 transitions. [2024-11-09 18:36:27,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 888 transitions. [2024-11-09 18:36:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 18:36:27,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:27,782 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:27,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 18:36:27,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:27,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:27,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1954245216, now seen corresponding path program 1 times [2024-11-09 18:36:27,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:27,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160411800] [2024-11-09 18:36:27,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:27,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 18:36:27,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:27,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160411800] [2024-11-09 18:36:27,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160411800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:27,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:27,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:36:27,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846794566] [2024-11-09 18:36:27,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:27,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:36:27,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:27,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:36:27,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:36:27,995 INFO L87 Difference]: Start difference. First operand 665 states and 888 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:28,597 INFO L93 Difference]: Finished difference Result 1856 states and 2428 transitions. [2024-11-09 18:36:28,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:36:28,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 136 [2024-11-09 18:36:28,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:28,602 INFO L225 Difference]: With dead ends: 1856 [2024-11-09 18:36:28,602 INFO L226 Difference]: Without dead ends: 1193 [2024-11-09 18:36:28,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:36:28,604 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 270 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:28,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 46 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 18:36:28,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-09 18:36:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1061. [2024-11-09 18:36:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.2622641509433963) internal successors, (1338), 1060 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1338 transitions. [2024-11-09 18:36:28,626 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1338 transitions. Word has length 136 [2024-11-09 18:36:28,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:28,627 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1338 transitions. [2024-11-09 18:36:28,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1338 transitions. [2024-11-09 18:36:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 18:36:28,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:28,632 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:28,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 18:36:28,632 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:28,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:28,633 INFO L85 PathProgramCache]: Analyzing trace with hash 537932976, now seen corresponding path program 1 times [2024-11-09 18:36:28,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:28,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690981036] [2024-11-09 18:36:28,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:28,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-09 18:36:28,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:28,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690981036] [2024-11-09 18:36:28,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690981036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:28,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:28,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:36:28,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114237733] [2024-11-09 18:36:28,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:28,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:28,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:28,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:28,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:28,753 INFO L87 Difference]: Start difference. First operand 1061 states and 1338 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:29,199 INFO L93 Difference]: Finished difference Result 2780 states and 3478 transitions. [2024-11-09 18:36:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:29,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2024-11-09 18:36:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:29,206 INFO L225 Difference]: With dead ends: 2780 [2024-11-09 18:36:29,206 INFO L226 Difference]: Without dead ends: 1721 [2024-11-09 18:36:29,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:29,208 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 138 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:29,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 26 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2024-11-09 18:36:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1325. [2024-11-09 18:36:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.2462235649546827) internal successors, (1650), 1324 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1650 transitions. [2024-11-09 18:36:29,235 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1650 transitions. Word has length 146 [2024-11-09 18:36:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:29,235 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1650 transitions. [2024-11-09 18:36:29,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:29,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1650 transitions. [2024-11-09 18:36:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 18:36:29,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:29,238 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:29,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:36:29,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:29,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash 490132397, now seen corresponding path program 1 times [2024-11-09 18:36:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:29,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762365904] [2024-11-09 18:36:29,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:29,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-09 18:36:29,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:29,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762365904] [2024-11-09 18:36:29,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762365904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:29,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:29,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:29,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124014909] [2024-11-09 18:36:29,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:29,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:29,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:29,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:29,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:29,445 INFO L87 Difference]: Start difference. First operand 1325 states and 1650 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:29,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:29,807 INFO L93 Difference]: Finished difference Result 2648 states and 3298 transitions. [2024-11-09 18:36:29,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:29,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 161 [2024-11-09 18:36:29,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:29,812 INFO L225 Difference]: With dead ends: 2648 [2024-11-09 18:36:29,812 INFO L226 Difference]: Without dead ends: 1325 [2024-11-09 18:36:29,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:29,815 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 108 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:29,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 66 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:36:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2024-11-09 18:36:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2024-11-09 18:36:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.2326283987915407) internal successors, (1632), 1324 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1632 transitions. [2024-11-09 18:36:29,839 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1632 transitions. Word has length 161 [2024-11-09 18:36:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:29,839 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1632 transitions. [2024-11-09 18:36:29,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1632 transitions. [2024-11-09 18:36:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 18:36:29,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:29,842 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:29,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 18:36:29,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:29,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash -842619614, now seen corresponding path program 1 times [2024-11-09 18:36:29,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:29,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925269111] [2024-11-09 18:36:29,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 18:36:30,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:30,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925269111] [2024-11-09 18:36:30,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925269111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:30,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:30,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:36:30,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757296955] [2024-11-09 18:36:30,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:30,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:36:30,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:30,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:36:30,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:36:30,060 INFO L87 Difference]: Start difference. First operand 1325 states and 1632 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:30,666 INFO L93 Difference]: Finished difference Result 3440 states and 4162 transitions. [2024-11-09 18:36:30,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:36:30,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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-09 18:36:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:30,673 INFO L225 Difference]: With dead ends: 3440 [2024-11-09 18:36:30,673 INFO L226 Difference]: Without dead ends: 1985 [2024-11-09 18:36:30,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:36:30,675 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 249 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:30,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 46 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 18:36:30,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2024-11-09 18:36:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1721. [2024-11-09 18:36:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1720 states have (on average 1.194767441860465) internal successors, (2055), 1720 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2055 transitions. [2024-11-09 18:36:30,707 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2055 transitions. Word has length 166 [2024-11-09 18:36:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:30,708 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2055 transitions. [2024-11-09 18:36:30,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2055 transitions. [2024-11-09 18:36:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-09 18:36:30,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:30,712 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:30,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 18:36:30,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:30,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1783903156, now seen corresponding path program 1 times [2024-11-09 18:36:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:30,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885225311] [2024-11-09 18:36:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:30,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 100 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 18:36:31,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:31,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885225311] [2024-11-09 18:36:31,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885225311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:36:31,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090686550] [2024-11-09 18:36:31,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:31,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:36:31,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:36:31,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:36:31,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 18:36:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:31,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:36:31,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:36:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-09 18:36:31,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:36:31,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090686550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:31,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:36:31,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 18:36:31,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757586057] [2024-11-09 18:36:31,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:31,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:31,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:31,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:31,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:31,564 INFO L87 Difference]: Start difference. First operand 1721 states and 2055 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-09 18:36:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:31,941 INFO L93 Difference]: Finished difference Result 2516 states and 2986 transitions. [2024-11-09 18:36:31,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:31,942 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 183 [2024-11-09 18:36:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:31,950 INFO L225 Difference]: With dead ends: 2516 [2024-11-09 18:36:31,950 INFO L226 Difference]: Without dead ends: 2513 [2024-11-09 18:36:31,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:31,952 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:31,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 34 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:31,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2024-11-09 18:36:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 1721. [2024-11-09 18:36:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1720 states have (on average 1.194767441860465) internal successors, (2055), 1720 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2055 transitions. [2024-11-09 18:36:31,990 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2055 transitions. Word has length 183 [2024-11-09 18:36:31,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:31,990 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2055 transitions. [2024-11-09 18:36:31,990 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-09 18:36:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2055 transitions. [2024-11-09 18:36:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 18:36:31,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:31,995 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:32,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 18:36:32,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:36:32,196 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:32,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:32,197 INFO L85 PathProgramCache]: Analyzing trace with hash 737050369, now seen corresponding path program 1 times [2024-11-09 18:36:32,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:32,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017877142] [2024-11-09 18:36:32,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:32,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 129 proven. 16 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 18:36:32,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:32,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017877142] [2024-11-09 18:36:32,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017877142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:36:32,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253269923] [2024-11-09 18:36:32,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:32,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:36:32,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:36:32,721 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:36:32,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 18:36:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:32,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:36:32,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:36:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 18:36:33,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:36:33,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253269923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:33,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:36:33,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 18:36:33,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65381465] [2024-11-09 18:36:33,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:33,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:33,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:33,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:33,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:33,072 INFO L87 Difference]: Start difference. First operand 1721 states and 2055 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-09 18:36:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:33,458 INFO L93 Difference]: Finished difference Result 3440 states and 4108 transitions. [2024-11-09 18:36:33,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:33,459 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 212 [2024-11-09 18:36:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:33,464 INFO L225 Difference]: With dead ends: 3440 [2024-11-09 18:36:33,464 INFO L226 Difference]: Without dead ends: 1721 [2024-11-09 18:36:33,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:33,468 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 39 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:33,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 197 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2024-11-09 18:36:33,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1589. [2024-11-09 18:36:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 1.1700251889168767) internal successors, (1858), 1588 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1858 transitions. [2024-11-09 18:36:33,498 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1858 transitions. Word has length 212 [2024-11-09 18:36:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:33,498 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 1858 transitions. [2024-11-09 18:36:33,499 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-09 18:36:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1858 transitions. [2024-11-09 18:36:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-09 18:36:33,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:33,503 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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-09 18:36:33,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 18:36:33,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 18:36:33,705 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:33,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1860943322, now seen corresponding path program 1 times [2024-11-09 18:36:33,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:33,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9105310] [2024-11-09 18:36:33,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:33,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 129 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:34,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9105310] [2024-11-09 18:36:34,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9105310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:36:34,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340833196] [2024-11-09 18:36:34,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:34,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:36:34,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:36:34,314 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:36:34,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 18:36:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:34,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:36:34,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:36:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 18:36:34,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:36:34,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340833196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:34,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:36:34,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 18:36:34,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542227581] [2024-11-09 18:36:34,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:34,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:34,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:34,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:34,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:34,559 INFO L87 Difference]: Start difference. First operand 1589 states and 1858 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:34,984 INFO L93 Difference]: Finished difference Result 3305 states and 3866 transitions. [2024-11-09 18:36:34,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:34,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 224 [2024-11-09 18:36:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:34,985 INFO L225 Difference]: With dead ends: 3305 [2024-11-09 18:36:34,985 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 18:36:34,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:34,989 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:34,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 180 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 18:36:34,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 18:36:34,991 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-09 18:36:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 18:36:34,993 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2024-11-09 18:36:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:34,993 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 18:36:34,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 18:36:34,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 18:36:34,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:36:35,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 18:36:35,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:36:35,201 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:35,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 18:36:35,398 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:36:35,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:36:35 BoogieIcfgContainer [2024-11-09 18:36:35,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:36:35,408 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:36:35,408 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:36:35,409 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:36:35,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:36:24" (3/4) ... [2024-11-09 18:36:35,412 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 18:36:35,433 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 18:36:35,434 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 18:36:35,435 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 18:36:35,435 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 18:36:35,572 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:36:35,572 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 18:36:35,572 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:36:35,573 INFO L158 Benchmark]: Toolchain (without parser) took 13001.63ms. Allocated memory was 159.4MB in the beginning and 362.8MB in the end (delta: 203.4MB). Free memory was 101.7MB in the beginning and 264.9MB in the end (delta: -163.2MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2024-11-09 18:36:35,573 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory was 118.6MB in the beginning and 118.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:36:35,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.37ms. Allocated memory is still 159.4MB. Free memory was 101.7MB in the beginning and 72.0MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 18:36:35,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.97ms. Allocated memory is still 159.4MB. Free memory was 72.0MB in the beginning and 126.1MB in the end (delta: -54.1MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-11-09 18:36:35,574 INFO L158 Benchmark]: Boogie Preprocessor took 111.18ms. Allocated memory is still 159.4MB. Free memory was 125.3MB in the beginning and 121.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 18:36:35,574 INFO L158 Benchmark]: IcfgBuilder took 1193.48ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 121.1MB in the beginning and 161.9MB in the end (delta: -40.7MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. [2024-11-09 18:36:35,574 INFO L158 Benchmark]: TraceAbstraction took 10867.05ms. Allocated memory was 207.6MB in the beginning and 362.8MB in the end (delta: 155.2MB). Free memory was 160.8MB in the beginning and 277.5MB in the end (delta: -116.7MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2024-11-09 18:36:35,575 INFO L158 Benchmark]: Witness Printer took 164.05ms. Allocated memory is still 362.8MB. Free memory was 277.5MB in the beginning and 264.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 18:36:35,576 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.11ms. Allocated memory is still 159.4MB. Free memory was 118.6MB in the beginning and 118.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.37ms. Allocated memory is still 159.4MB. Free memory was 101.7MB in the beginning and 72.0MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.97ms. Allocated memory is still 159.4MB. Free memory was 72.0MB in the beginning and 126.1MB in the end (delta: -54.1MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.18ms. Allocated memory is still 159.4MB. Free memory was 125.3MB in the beginning and 121.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1193.48ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 121.1MB in the beginning and 161.9MB in the end (delta: -40.7MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10867.05ms. Allocated memory was 207.6MB in the beginning and 362.8MB in the end (delta: 155.2MB). Free memory was 160.8MB in the beginning and 277.5MB in the end (delta: -116.7MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * Witness Printer took 164.05ms. Allocated memory is still 362.8MB. Free memory was 277.5MB in the beginning and 264.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 486]: 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, 201 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1328 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1328 mSDsluCounter, 805 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 709 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4160 IncrementalHoareTripleChecker+Invalid, 4869 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 709 mSolverCounterUnsat, 718 mSDtfsCounter, 4160 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 652 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1721occurred in iteration=8, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1848 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2314 NumberOfCodeBlocks, 2314 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2300 ConstructedInterpolants, 0 QuantifiedInterpolants, 7401 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1141 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 1348/1427 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: 593]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 18:36:35,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE