./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label30.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version c7c6ca5d
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_label30.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 6b291da6da115062c14f66e51226c64b32b538a6c3d52e3544b8930bfb203253
--- Real Ultimate output ---
This is Ultimate 0.2.5-?-c7c6ca5-m
[2024-11-08 10:26:50,679 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-08 10:26:50,753 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 10:26:50,757 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 10:26:50,759 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 10:26:50,791 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 10:26:50,791 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 10:26:50,792 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 10:26:50,793 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 10:26:50,794 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-08 10:26:50,794 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 10:26:50,794 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 10:26:50,795 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 10:26:50,795 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-08 10:26:50,796 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-08 10:26:50,796 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 10:26:50,797 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-08 10:26:50,797 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-08 10:26:50,797 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-08 10:26:50,798 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-08 10:26:50,798 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-08 10:26:50,802 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 10:26:50,802 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 10:26:50,803 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 10:26:50,803 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-08 10:26:50,803 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-08 10:26:50,803 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-08 10:26:50,804 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-08 10:26:50,804 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 10:26:50,804 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-08 10:26:50,805 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 10:26:50,805 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-08 10:26:50,805 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 10:26:50,805 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 10:26:50,805 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 10:26:50,806 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 10:26:50,806 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-08 10:26:50,807 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 10:26:50,807 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 10:26:50,808 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 10:26:50,808 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 10:26:50,809 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 10:26:50,809 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 -> 6b291da6da115062c14f66e51226c64b32b538a6c3d52e3544b8930bfb203253
[2024-11-08 10:26:51,061 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 10:26:51,081 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 10:26:51,084 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 10:26:51,085 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-08 10:26:51,086 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-08 10:26:51,087 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label30.c
[2024-11-08 10:26:52,588 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-08 10:26:52,887 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-08 10:26:52,887 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label30.c
[2024-11-08 10:26:52,905 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c90a9c7ae/3fda6afd598c45d7bf199e5d95b01768/FLAG1258ff881
[2024-11-08 10:26:52,920 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c90a9c7ae/3fda6afd598c45d7bf199e5d95b01768
[2024-11-08 10:26:52,923 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 10:26:52,925 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 10:26:52,927 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 10:26:52,927 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 10:26:52,933 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 10:26:52,933 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:26:52" (1/1) ...
[2024-11-08 10:26:52,936 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16227fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:52, skipping insertion in model container
[2024-11-08 10:26:52,936 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:26:52" (1/1) ...
[2024-11-08 10:26:52,984 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-08 10:26:53,358 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_label30.c[21088,21101]
[2024-11-08 10:26:53,385 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 10:26:53,399 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-08 10:26:53,493 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_label30.c[21088,21101]
[2024-11-08 10:26:53,503 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 10:26:53,523 INFO  L204         MainTranslator]: Completed translation
[2024-11-08 10:26:53,527 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:53 WrapperNode
[2024-11-08 10:26:53,527 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 10:26:53,529 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 10:26:53,529 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 10:26:53,529 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 10:26:53,536 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:53" (1/1) ...
[2024-11-08 10:26:53,562 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:53" (1/1) ...
[2024-11-08 10:26:53,627 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658
[2024-11-08 10:26:53,627 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 10:26:53,646 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 10:26:53,647 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 10:26:53,647 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 10:26:53,659 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:53" (1/1) ...
[2024-11-08 10:26:53,660 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:53" (1/1) ...
[2024-11-08 10:26:53,664 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:53" (1/1) ...
[2024-11-08 10:26:53,687 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-08 10:26:53,688 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:53" (1/1) ...
[2024-11-08 10:26:53,688 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:53" (1/1) ...
[2024-11-08 10:26:53,710 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:53" (1/1) ...
[2024-11-08 10:26:53,717 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:53" (1/1) ...
[2024-11-08 10:26:53,723 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:53" (1/1) ...
[2024-11-08 10:26:53,727 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:53" (1/1) ...
[2024-11-08 10:26:53,735 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 10:26:53,736 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 10:26:53,736 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 10:26:53,736 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-08 10:26:53,737 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:53" (1/1) ...
[2024-11-08 10:26:53,746 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 10:26:53,763 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 10:26:53,780 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-08 10:26:53,784 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-08 10:26:53,831 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 10:26:53,831 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 10:26:53,832 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 10:26:53,832 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 10:26:53,924 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-08 10:26:53,926 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 10:26:54,891 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2024-11-08 10:26:54,892 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-08 10:26:54,916 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 10:26:54,916 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 10:26:54,916 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:26:54 BoogieIcfgContainer
[2024-11-08 10:26:54,916 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 10:26:54,919 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 10:26:54,919 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 10:26:54,922 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-08 10:26:54,922 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:26:52" (1/3) ...
[2024-11-08 10:26:54,923 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6827a543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:26:54, skipping insertion in model container
[2024-11-08 10:26:54,923 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:53" (2/3) ...
[2024-11-08 10:26:54,925 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6827a543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:26:54, skipping insertion in model container
[2024-11-08 10:26:54,925 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:26:54" (3/3) ...
[2024-11-08 10:26:54,928 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem01_label30.c
[2024-11-08 10:26:54,947 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 10:26:54,948 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 10:26:55,019 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 10:26:55,027 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;@cc96369, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 10:26:55,028 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 10:26:55,034 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:26:55,048 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-11-08 10:26:55,049 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:26:55,050 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, 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-08 10:26:55,050 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:26:55,058 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:26:55,059 INFO  L85        PathProgramCache]: Analyzing trace with hash -1318724346, now seen corresponding path program 1 times
[2024-11-08 10:26:55,068 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:26:55,069 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620947406]
[2024-11-08 10:26:55,069 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:26:55,070 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:26:55,256 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:26:55,976 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-08 10:26:55,977 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:26:55,977 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620947406]
[2024-11-08 10:26:55,978 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620947406] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:26:55,978 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:26:55,978 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:26:55,981 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996184380]
[2024-11-08 10:26:55,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:26:55,987 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 10:26:55,988 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:26:56,013 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 10:26:56,014 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 10:26:56,017 INFO  L87              Difference]: Start difference. First operand  has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 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 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:26:57,098 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:26:57,098 INFO  L93              Difference]: Finished difference Result 662 states and 1178 transitions.
[2024-11-08 10:26:57,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-08 10:26:57,101 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125
[2024-11-08 10:26:57,102 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:26:57,114 INFO  L225             Difference]: With dead ends: 662
[2024-11-08 10:26:57,115 INFO  L226             Difference]: Without dead ends: 397
[2024-11-08 10:26:57,118 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 10:26:57,121 INFO  L432           NwaCegarLoop]: 65 mSDtfsCounter, 305 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-08 10:26:57,122 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 81 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-08 10:26:57,137 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 397 states.
[2024-11-08 10:26:57,166 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397.
[2024-11-08 10:26:57,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 397 states, 396 states have (on average 1.3055555555555556) internal successors, (517), 396 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:26:57,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 517 transitions.
[2024-11-08 10:26:57,171 INFO  L78                 Accepts]: Start accepts. Automaton has 397 states and 517 transitions. Word has length 125
[2024-11-08 10:26:57,172 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:26:57,172 INFO  L471      AbstractCegarLoop]: Abstraction has 397 states and 517 transitions.
[2024-11-08 10:26:57,173 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:26:57,173 INFO  L276                IsEmpty]: Start isEmpty. Operand 397 states and 517 transitions.
[2024-11-08 10:26:57,177 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2024-11-08 10:26:57,179 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:26:57,179 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:26:57,179 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 10:26:57,180 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:26:57,181 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:26:57,181 INFO  L85        PathProgramCache]: Analyzing trace with hash 1433476435, now seen corresponding path program 1 times
[2024-11-08 10:26:57,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:26:57,181 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848502467]
[2024-11-08 10:26:57,182 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:26:57,182 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:26:57,235 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:26:57,620 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 10:26:57,620 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:26:57,620 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848502467]
[2024-11-08 10:26:57,620 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848502467] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:26:57,620 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:26:57,620 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:26:57,621 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183306936]
[2024-11-08 10:26:57,621 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:26:57,624 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 10:26:57,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:26:57,625 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 10:26:57,626 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 10:26:57,626 INFO  L87              Difference]: Start difference. First operand 397 states and 517 transitions. Second operand  has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:26:58,297 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:26:58,297 INFO  L93              Difference]: Finished difference Result 887 states and 1235 transitions.
[2024-11-08 10:26:58,301 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 10:26:58,302 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 132
[2024-11-08 10:26:58,302 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:26:58,304 INFO  L225             Difference]: With dead ends: 887
[2024-11-08 10:26:58,305 INFO  L226             Difference]: Without dead ends: 528
[2024-11-08 10:26:58,306 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-08 10:26:58,307 INFO  L432           NwaCegarLoop]: 71 mSDtfsCounter, 128 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-08 10:26:58,308 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 81 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-08 10:26:58,309 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2024-11-08 10:26:58,331 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 397.
[2024-11-08 10:26:58,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 397 states, 396 states have (on average 1.196969696969697) internal successors, (474), 396 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:26:58,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 474 transitions.
[2024-11-08 10:26:58,337 INFO  L78                 Accepts]: Start accepts. Automaton has 397 states and 474 transitions. Word has length 132
[2024-11-08 10:26:58,337 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:26:58,338 INFO  L471      AbstractCegarLoop]: Abstraction has 397 states and 474 transitions.
[2024-11-08 10:26:58,338 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:26:58,338 INFO  L276                IsEmpty]: Start isEmpty. Operand 397 states and 474 transitions.
[2024-11-08 10:26:58,341 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2024-11-08 10:26:58,341 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:26:58,342 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:26:58,342 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 10:26:58,342 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:26:58,343 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:26:58,343 INFO  L85        PathProgramCache]: Analyzing trace with hash 1235549653, now seen corresponding path program 1 times
[2024-11-08 10:26:58,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:26:58,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475582024]
[2024-11-08 10:26:58,344 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:26:58,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:26:58,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:26:58,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-08 10:26:58,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:26:58,541 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475582024]
[2024-11-08 10:26:58,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475582024] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:26:58,541 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:26:58,542 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 10:26:58,542 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560506836]
[2024-11-08 10:26:58,542 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:26:58,542 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:26:58,542 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:26:58,543 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:26:58,545 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:26:58,546 INFO  L87              Difference]: Start difference. First operand 397 states and 474 transitions. Second operand  has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:26:58,897 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:26:58,898 INFO  L93              Difference]: Finished difference Result 923 states and 1105 transitions.
[2024-11-08 10:26:58,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:26:58,898 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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 140
[2024-11-08 10:26:58,898 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:26:58,900 INFO  L225             Difference]: With dead ends: 923
[2024-11-08 10:26:58,900 INFO  L226             Difference]: Without dead ends: 528
[2024-11-08 10:26:58,901 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-08 10:26:58,902 INFO  L432           NwaCegarLoop]: 42 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 10:26:58,903 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 46 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 10:26:58,904 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2024-11-08 10:26:58,911 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528.
[2024-11-08 10:26:58,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 528 states, 527 states have (on average 1.1707779886148009) internal successors, (617), 527 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:26:58,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 617 transitions.
[2024-11-08 10:26:58,915 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 617 transitions. Word has length 140
[2024-11-08 10:26:58,943 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:26:58,945 INFO  L471      AbstractCegarLoop]: Abstraction has 528 states and 617 transitions.
[2024-11-08 10:26:58,945 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:26:58,945 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 617 transitions.
[2024-11-08 10:26:58,947 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2024-11-08 10:26:58,947 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:26:58,947 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:26:58,947 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 10:26:58,948 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:26:58,948 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:26:58,948 INFO  L85        PathProgramCache]: Analyzing trace with hash -382953037, now seen corresponding path program 1 times
[2024-11-08 10:26:58,949 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:26:58,949 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604447858]
[2024-11-08 10:26:58,949 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:26:58,949 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:26:58,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:26:59,078 INFO  L134       CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-11-08 10:26:59,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:26:59,079 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604447858]
[2024-11-08 10:26:59,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604447858] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:26:59,079 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:26:59,080 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:26:59,080 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311571210]
[2024-11-08 10:26:59,080 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:26:59,080 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:26:59,081 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:26:59,081 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:26:59,081 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:26:59,082 INFO  L87              Difference]: Start difference. First operand 528 states and 617 transitions. Second operand  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:26:59,459 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:26:59,460 INFO  L93              Difference]: Finished difference Result 1578 states and 1846 transitions.
[2024-11-08 10:26:59,460 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:26:59,460 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 149
[2024-11-08 10:26:59,461 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:26:59,465 INFO  L225             Difference]: With dead ends: 1578
[2024-11-08 10:26:59,465 INFO  L226             Difference]: Without dead ends: 1052
[2024-11-08 10:26:59,468 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-08 10:26:59,471 INFO  L432           NwaCegarLoop]: 24 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 10:26:59,471 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 28 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 10:26:59,473 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1052 states.
[2024-11-08 10:26:59,490 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921.
[2024-11-08 10:26:59,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 921 states, 920 states have (on average 1.1891304347826086) internal successors, (1094), 920 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:26:59,494 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1094 transitions.
[2024-11-08 10:26:59,494 INFO  L78                 Accepts]: Start accepts. Automaton has 921 states and 1094 transitions. Word has length 149
[2024-11-08 10:26:59,495 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:26:59,495 INFO  L471      AbstractCegarLoop]: Abstraction has 921 states and 1094 transitions.
[2024-11-08 10:26:59,495 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:26:59,495 INFO  L276                IsEmpty]: Start isEmpty. Operand 921 states and 1094 transitions.
[2024-11-08 10:26:59,497 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2024-11-08 10:26:59,498 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:26:59,498 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:26:59,498 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 10:26:59,498 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:26:59,499 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:26:59,499 INFO  L85        PathProgramCache]: Analyzing trace with hash 796323556, now seen corresponding path program 1 times
[2024-11-08 10:26:59,499 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:26:59,500 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929427876]
[2024-11-08 10:26:59,500 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:26:59,500 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:26:59,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:26:59,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-08 10:26:59,700 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:26:59,700 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929427876]
[2024-11-08 10:26:59,700 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929427876] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:26:59,700 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:26:59,701 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:26:59,701 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190093994]
[2024-11-08 10:26:59,701 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:26:59,701 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 10:26:59,701 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:26:59,702 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 10:26:59,702 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 10:26:59,704 INFO  L87              Difference]: Start difference. First operand 921 states and 1094 transitions. Second operand  has 4 states, 4 states have (on average 38.25) 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-08 10:27:00,269 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:00,269 INFO  L93              Difference]: Finished difference Result 2364 states and 2857 transitions.
[2024-11-08 10:27:00,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 10:27:00,270 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 38.25) 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 155
[2024-11-08 10:27:00,270 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:00,275 INFO  L225             Difference]: With dead ends: 2364
[2024-11-08 10:27:00,275 INFO  L226             Difference]: Without dead ends: 1445
[2024-11-08 10:27:00,277 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-08 10:27:00,279 INFO  L432           NwaCegarLoop]: 27 mSDtfsCounter, 258 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:00,280 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 36 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 10:27:00,282 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1445 states.
[2024-11-08 10:27:00,305 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183.
[2024-11-08 10:27:00,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1183 states, 1182 states have (on average 1.1776649746192893) internal successors, (1392), 1182 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:00,310 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1392 transitions.
[2024-11-08 10:27:00,311 INFO  L78                 Accepts]: Start accepts. Automaton has 1183 states and 1392 transitions. Word has length 155
[2024-11-08 10:27:00,311 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:00,312 INFO  L471      AbstractCegarLoop]: Abstraction has 1183 states and 1392 transitions.
[2024-11-08 10:27:00,312 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 38.25) 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-08 10:27:00,313 INFO  L276                IsEmpty]: Start isEmpty. Operand 1183 states and 1392 transitions.
[2024-11-08 10:27:00,316 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2024-11-08 10:27:00,316 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:00,317 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:00,317 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 10:27:00,317 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:00,318 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:00,318 INFO  L85        PathProgramCache]: Analyzing trace with hash -1320007935, now seen corresponding path program 1 times
[2024-11-08 10:27:00,318 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:00,318 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816170114]
[2024-11-08 10:27:00,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:00,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:00,358 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:00,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-08 10:27:00,553 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:00,553 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816170114]
[2024-11-08 10:27:00,553 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816170114] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:00,553 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:00,553 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:00,553 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928559153]
[2024-11-08 10:27:00,553 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:00,554 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 10:27:00,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:00,554 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 10:27:00,554 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 10:27:00,555 INFO  L87              Difference]: Start difference. First operand 1183 states and 1392 transitions. Second operand  has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:01,149 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:01,149 INFO  L93              Difference]: Finished difference Result 3019 states and 3514 transitions.
[2024-11-08 10:27:01,150 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 10:27:01,150 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 169
[2024-11-08 10:27:01,150 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:01,160 INFO  L225             Difference]: With dead ends: 3019
[2024-11-08 10:27:01,161 INFO  L226             Difference]: Without dead ends: 1707
[2024-11-08 10:27:01,163 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-08 10:27:01,164 INFO  L432           NwaCegarLoop]: 30 mSDtfsCounter, 245 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:01,165 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 40 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-08 10:27:01,168 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1707 states.
[2024-11-08 10:27:01,192 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576.
[2024-11-08 10:27:01,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1576 states, 1575 states have (on average 1.1403174603174604) internal successors, (1796), 1575 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:01,198 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1796 transitions.
[2024-11-08 10:27:01,201 INFO  L78                 Accepts]: Start accepts. Automaton has 1576 states and 1796 transitions. Word has length 169
[2024-11-08 10:27:01,201 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:01,201 INFO  L471      AbstractCegarLoop]: Abstraction has 1576 states and 1796 transitions.
[2024-11-08 10:27:01,201 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:01,201 INFO  L276                IsEmpty]: Start isEmpty. Operand 1576 states and 1796 transitions.
[2024-11-08 10:27:01,206 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 187
[2024-11-08 10:27:01,207 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:01,207 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:01,207 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 10:27:01,207 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:01,208 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:01,208 INFO  L85        PathProgramCache]: Analyzing trace with hash 1887014276, now seen corresponding path program 1 times
[2024-11-08 10:27:01,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:01,208 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285424746]
[2024-11-08 10:27:01,208 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:01,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:01,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:01,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 10:27:01,486 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:01,487 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285424746]
[2024-11-08 10:27:01,487 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285424746] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:01,487 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:01,488 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 10:27:01,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692748593]
[2024-11-08 10:27:01,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:01,489 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 10:27:01,489 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:01,489 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 10:27:01,490 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 10:27:01,490 INFO  L87              Difference]: Start difference. First operand 1576 states and 1796 transitions. Second operand  has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:02,092 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:02,092 INFO  L93              Difference]: Finished difference Result 3543 states and 4038 transitions.
[2024-11-08 10:27:02,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 10:27:02,093 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 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 186
[2024-11-08 10:27:02,093 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:02,099 INFO  L225             Difference]: With dead ends: 3543
[2024-11-08 10:27:02,100 INFO  L226             Difference]: Without dead ends: 1969
[2024-11-08 10:27:02,102 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-08 10:27:02,105 INFO  L432           NwaCegarLoop]: 17 mSDtfsCounter, 225 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:02,105 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 26 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-08 10:27:02,108 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1969 states.
[2024-11-08 10:27:02,136 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707.
[2024-11-08 10:27:02,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1707 states, 1706 states have (on average 1.130715123094959) internal successors, (1929), 1706 states have internal predecessors, (1929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:02,141 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1929 transitions.
[2024-11-08 10:27:02,142 INFO  L78                 Accepts]: Start accepts. Automaton has 1707 states and 1929 transitions. Word has length 186
[2024-11-08 10:27:02,143 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:02,143 INFO  L471      AbstractCegarLoop]: Abstraction has 1707 states and 1929 transitions.
[2024-11-08 10:27:02,143 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:02,143 INFO  L276                IsEmpty]: Start isEmpty. Operand 1707 states and 1929 transitions.
[2024-11-08 10:27:02,147 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 212
[2024-11-08 10:27:02,147 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:02,148 INFO  L215           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:02,148 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 10:27:02,148 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:02,148 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:02,149 INFO  L85        PathProgramCache]: Analyzing trace with hash 1514671075, now seen corresponding path program 1 times
[2024-11-08 10:27:02,149 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:02,149 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841757152]
[2024-11-08 10:27:02,149 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:02,149 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:02,189 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:02,418 INFO  L134       CoverageAnalysis]: Checked inductivity of 161 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked.
[2024-11-08 10:27:02,418 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:02,418 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841757152]
[2024-11-08 10:27:02,418 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841757152] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:02,418 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:02,418 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:02,418 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341878946]
[2024-11-08 10:27:02,419 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:02,419 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 10:27:02,419 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:02,419 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 10:27:02,420 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 10:27:02,420 INFO  L87              Difference]: Start difference. First operand 1707 states and 1929 transitions. Second operand  has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:03,007 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:03,007 INFO  L93              Difference]: Finished difference Result 3674 states and 4206 transitions.
[2024-11-08 10:27:03,007 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 10:27:03,008 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 211
[2024-11-08 10:27:03,008 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:03,014 INFO  L225             Difference]: With dead ends: 3674
[2024-11-08 10:27:03,014 INFO  L226             Difference]: Without dead ends: 1969
[2024-11-08 10:27:03,016 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-08 10:27:03,018 INFO  L432           NwaCegarLoop]: 32 mSDtfsCounter, 253 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:03,018 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 44 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-08 10:27:03,022 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1969 states.
[2024-11-08 10:27:03,048 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969.
[2024-11-08 10:27:03,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1969 states, 1968 states have (on average 1.1316056910569106) internal successors, (2227), 1968 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:03,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2227 transitions.
[2024-11-08 10:27:03,055 INFO  L78                 Accepts]: Start accepts. Automaton has 1969 states and 2227 transitions. Word has length 211
[2024-11-08 10:27:03,056 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:03,056 INFO  L471      AbstractCegarLoop]: Abstraction has 1969 states and 2227 transitions.
[2024-11-08 10:27:03,056 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:03,056 INFO  L276                IsEmpty]: Start isEmpty. Operand 1969 states and 2227 transitions.
[2024-11-08 10:27:03,060 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2024-11-08 10:27:03,060 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:03,061 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-08 10:27:03,061 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 10:27:03,061 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:03,061 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:03,061 INFO  L85        PathProgramCache]: Analyzing trace with hash 330684196, now seen corresponding path program 1 times
[2024-11-08 10:27:03,061 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:03,062 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545686105]
[2024-11-08 10:27:03,062 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:03,062 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:03,133 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:03,243 INFO  L134       CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2024-11-08 10:27:03,243 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:03,243 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545686105]
[2024-11-08 10:27:03,244 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545686105] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:03,244 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:03,244 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:03,244 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426392160]
[2024-11-08 10:27:03,244 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:03,244 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:03,245 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:03,245 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:03,245 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:03,245 INFO  L87              Difference]: Start difference. First operand 1969 states and 2227 transitions. Second operand  has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:03,598 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:03,600 INFO  L93              Difference]: Finished difference Result 4198 states and 4725 transitions.
[2024-11-08 10:27:03,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:03,601 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 229
[2024-11-08 10:27:03,601 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:03,608 INFO  L225             Difference]: With dead ends: 4198
[2024-11-08 10:27:03,609 INFO  L226             Difference]: Without dead ends: 2231
[2024-11-08 10:27:03,611 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-08 10:27:03,612 INFO  L432           NwaCegarLoop]: 173 mSDtfsCounter, 86 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:03,612 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 179 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 10:27:03,615 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2231 states.
[2024-11-08 10:27:03,644 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100.
[2024-11-08 10:27:03,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2100 states, 2099 states have (on average 1.10814673654121) internal successors, (2326), 2099 states have internal predecessors, (2326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:03,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2326 transitions.
[2024-11-08 10:27:03,652 INFO  L78                 Accepts]: Start accepts. Automaton has 2100 states and 2326 transitions. Word has length 229
[2024-11-08 10:27:03,653 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:03,653 INFO  L471      AbstractCegarLoop]: Abstraction has 2100 states and 2326 transitions.
[2024-11-08 10:27:03,653 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:03,653 INFO  L276                IsEmpty]: Start isEmpty. Operand 2100 states and 2326 transitions.
[2024-11-08 10:27:03,658 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 252
[2024-11-08 10:27:03,658 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:03,658 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 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]
[2024-11-08 10:27:03,658 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-08 10:27:03,659 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:03,659 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:03,659 INFO  L85        PathProgramCache]: Analyzing trace with hash 1135462701, now seen corresponding path program 1 times
[2024-11-08 10:27:03,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:03,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187003425]
[2024-11-08 10:27:03,660 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:03,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:03,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:03,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 218 backedges. 124 proven. 67 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2024-11-08 10:27:03,967 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:03,967 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187003425]
[2024-11-08 10:27:03,967 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187003425] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 10:27:03,967 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253760594]
[2024-11-08 10:27:03,967 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:03,968 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 10:27:03,968 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 10:27:03,970 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-08 10:27:03,971 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-08 10:27:04,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:04,116 INFO  L255         TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 10:27:04,131 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 10:27:04,351 INFO  L134       CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2024-11-08 10:27:04,351 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 10:27:04,351 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [253760594] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:04,352 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 10:27:04,352 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2024-11-08 10:27:04,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704336266]
[2024-11-08 10:27:04,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:04,352 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:04,353 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:04,353 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:04,353 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 10:27:04,354 INFO  L87              Difference]: Start difference. First operand 2100 states and 2326 transitions. Second operand  has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:04,757 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:04,758 INFO  L93              Difference]: Finished difference Result 4198 states and 4650 transitions.
[2024-11-08 10:27:04,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:04,759 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 251
[2024-11-08 10:27:04,759 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:04,766 INFO  L225             Difference]: With dead ends: 4198
[2024-11-08 10:27:04,766 INFO  L226             Difference]: Without dead ends: 2100
[2024-11-08 10:27:04,769 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 10:27:04,770 INFO  L432           NwaCegarLoop]: 166 mSDtfsCounter, 15 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:04,770 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 172 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 10:27:04,772 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2100 states.
[2024-11-08 10:27:04,803 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969.
[2024-11-08 10:27:04,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1969 states, 1968 states have (on average 1.0741869918699187) internal successors, (2114), 1968 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:04,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2114 transitions.
[2024-11-08 10:27:04,811 INFO  L78                 Accepts]: Start accepts. Automaton has 1969 states and 2114 transitions. Word has length 251
[2024-11-08 10:27:04,812 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:04,812 INFO  L471      AbstractCegarLoop]: Abstraction has 1969 states and 2114 transitions.
[2024-11-08 10:27:04,812 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:04,812 INFO  L276                IsEmpty]: Start isEmpty. Operand 1969 states and 2114 transitions.
[2024-11-08 10:27:04,818 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 268
[2024-11-08 10:27:04,818 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:04,818 INFO  L215           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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]
[2024-11-08 10:27:04,836 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-08 10:27:05,019 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2024-11-08 10:27:05,020 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:05,021 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:05,021 INFO  L85        PathProgramCache]: Analyzing trace with hash -1118272749, now seen corresponding path program 1 times
[2024-11-08 10:27:05,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:05,022 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672767722]
[2024-11-08 10:27:05,022 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:05,022 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:05,094 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:05,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 285 backedges. 175 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2024-11-08 10:27:05,700 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:05,700 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672767722]
[2024-11-08 10:27:05,700 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672767722] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 10:27:05,700 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917490642]
[2024-11-08 10:27:05,701 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:05,701 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 10:27:05,701 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 10:27:05,703 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-08 10:27:05,704 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-08 10:27:05,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:05,856 INFO  L255         TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 10:27:05,865 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 10:27:06,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 285 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2024-11-08 10:27:06,027 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 10:27:06,027 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917490642] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:06,027 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 10:27:06,027 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2024-11-08 10:27:06,027 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151711994]
[2024-11-08 10:27:06,028 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:06,029 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:06,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:06,030 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:06,030 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-11-08 10:27:06,031 INFO  L87              Difference]: Start difference. First operand 1969 states and 2114 transitions. Second operand  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:06,420 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:06,420 INFO  L93              Difference]: Finished difference Result 4065 states and 4378 transitions.
[2024-11-08 10:27:06,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:06,421 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 267
[2024-11-08 10:27:06,421 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:06,422 INFO  L225             Difference]: With dead ends: 4065
[2024-11-08 10:27:06,422 INFO  L226             Difference]: Without dead ends: 0
[2024-11-08 10:27:06,426 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-11-08 10:27:06,426 INFO  L432           NwaCegarLoop]: 156 mSDtfsCounter, 13 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:06,427 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 161 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 10:27:06,427 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-08 10:27:06,427 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-08 10:27:06,427 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-08 10:27:06,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-08 10:27:06,428 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 267
[2024-11-08 10:27:06,428 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:06,428 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-08 10:27:06,428 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:06,429 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-08 10:27:06,429 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-08 10:27:06,433 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 10:27:06,451 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-08 10:27:06,634 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,SelfDestructingSolverStorable10
[2024-11-08 10:27:06,637 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:06,639 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-08 10:27:06,859 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 10:27:06,877 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:27:06 BoogieIcfgContainer
[2024-11-08 10:27:06,877 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 10:27:06,878 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 10:27:06,878 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-08 10:27:06,878 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-08 10:27:06,879 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:26:54" (3/4) ...
[2024-11-08 10:27:06,881 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-08 10:27:06,894 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-08 10:27:06,895 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-08 10:27:06,896 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-08 10:27:06,897 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-08 10:27:07,052 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-08 10:27:07,053 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-08 10:27:07,053 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 10:27:07,054 INFO  L158              Benchmark]: Toolchain (without parser) took 14129.00ms. Allocated memory was 159.4MB in the beginning and 377.5MB in the end (delta: 218.1MB). Free memory was 100.5MB in the beginning and 263.6MB in the end (delta: -163.1MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB.
[2024-11-08 10:27:07,054 INFO  L158              Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 10:27:07,054 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 600.72ms. Allocated memory is still 159.4MB. Free memory was 100.4MB in the beginning and 70.6MB in the end (delta: 29.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB.
[2024-11-08 10:27:07,054 INFO  L158              Benchmark]: Boogie Procedure Inliner took 98.89ms. Allocated memory is still 159.4MB. Free memory was 70.6MB in the beginning and 126.2MB in the end (delta: -55.6MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB.
[2024-11-08 10:27:07,055 INFO  L158              Benchmark]: Boogie Preprocessor took 89.24ms. Allocated memory is still 203.4MB. Free memory was 171.1MB in the beginning and 166.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 10:27:07,055 INFO  L158              Benchmark]: RCFGBuilder took 1180.92ms. Allocated memory is still 203.4MB. Free memory was 166.1MB in the beginning and 81.1MB in the end (delta: 84.9MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB.
[2024-11-08 10:27:07,055 INFO  L158              Benchmark]: TraceAbstraction took 11958.71ms. Allocated memory was 203.4MB in the beginning and 377.5MB in the end (delta: 174.1MB). Free memory was 80.1MB in the beginning and 276.2MB in the end (delta: -196.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 10:27:07,056 INFO  L158              Benchmark]: Witness Printer took 175.30ms. Allocated memory is still 377.5MB. Free memory was 276.2MB in the beginning and 263.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-08 10:27:07,057 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.19ms. Allocated memory is still 159.4MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 600.72ms. Allocated memory is still 159.4MB. Free memory was 100.4MB in the beginning and 70.6MB in the end (delta: 29.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 98.89ms. Allocated memory is still 159.4MB. Free memory was 70.6MB in the beginning and 126.2MB in the end (delta: -55.6MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 89.24ms. Allocated memory is still 203.4MB. Free memory was 171.1MB in the beginning and 166.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1180.92ms. Allocated memory is still 203.4MB. Free memory was 166.1MB in the beginning and 81.1MB in the end (delta: 84.9MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB.
 * TraceAbstraction took 11958.71ms. Allocated memory was 203.4MB in the beginning and 377.5MB in the end (delta: 174.1MB). Free memory was 80.1MB in the beginning and 276.2MB in the end (delta: -196.1MB). There was no memory consumed. Max. memory is 16.1GB.
 * Witness Printer took 175.30ms. Allocated memory is still 377.5MB. Free memory was 276.2MB in the beginning and 263.6MB 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: 561]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1785 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1785 mSDsluCounter, 894 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 889 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4989 IncrementalHoareTripleChecker+Invalid, 5878 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 889 mSolverCounterUnsat, 803 mSDtfsCounter, 4989 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=9, InterpolantAutomatonStates: 40, 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, 1179 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2532 NumberOfCodeBlocks, 2532 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2519 ConstructedInterpolants, 0 QuantifiedInterpolants, 10376 SizeOfPredicates, 0 NumberOfNonLiveVariables, 916 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1447/1597 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]: Loop Invariant
    Derived loop invariant: (((((((((a21 <= 0) && (a16 <= 5)) || ((((((a12 == 8) && (a8 == 13)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) || ((a21 <= 0) && (a17 <= 0))) || (((a7 != 1) && (a17 <= 0)) && (a21 == 1))) || (((a17 <= 0) && (a21 == 1)) && (a16 <= 5))) || ((((a7 != 1) && (6 <= a16)) && (a21 == 1)) && (a17 == 1))) || ((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a17 == 1))) || ((((a20 != 1) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)))
RESULT: Ultimate proved your program to be correct!
[2024-11-08 10:27:07,086 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE