./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label46.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version fca748b1
Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label46.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 6c9ef72945147e4ae81caf50df56c252d6632fa10df84ba86d26e6872e2ab991
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m
[2024-11-19 17:19:40,970 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-19 17:19:41,025 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-19 17:19:41,029 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-19 17:19:41,030 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-19 17:19:41,045 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-19 17:19:41,046 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-19 17:19:41,046 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-19 17:19:41,046 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-19 17:19:41,048 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-19 17:19:41,048 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-19 17:19:41,048 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-19 17:19:41,049 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-19 17:19:41,052 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-19 17:19:41,052 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-19 17:19:41,052 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-19 17:19:41,052 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-19 17:19:41,053 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-19 17:19:41,053 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-19 17:19:41,053 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-19 17:19:41,053 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-19 17:19:41,053 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-19 17:19:41,054 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-19 17:19:41,054 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-19 17:19:41,054 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-19 17:19:41,054 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-19 17:19:41,054 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-19 17:19:41,054 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-19 17:19:41,055 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-19 17:19:41,055 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-19 17:19:41,055 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-19 17:19:41,055 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-19 17:19:41,055 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 17:19:41,055 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-19 17:19:41,055 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-19 17:19:41,056 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-19 17:19:41,056 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-19 17:19:41,056 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-19 17:19:41,056 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-19 17:19:41,056 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-19 17:19:41,056 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-19 17:19:41,057 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-19 17:19:41,058 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 -> 6c9ef72945147e4ae81caf50df56c252d6632fa10df84ba86d26e6872e2ab991
[2024-11-19 17:19:41,272 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-19 17:19:41,295 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-19 17:19:41,299 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-19 17:19:41,300 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-19 17:19:41,300 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-19 17:19:41,301 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label46.c
[2024-11-19 17:19:42,532 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-19 17:19:42,756 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-19 17:19:42,757 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label46.c
[2024-11-19 17:19:42,771 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51d5e160e/15396f3291a44754b9ee72635abc1456/FLAG5d6901875
[2024-11-19 17:19:43,089 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51d5e160e/15396f3291a44754b9ee72635abc1456
[2024-11-19 17:19:43,092 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-19 17:19:43,093 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-19 17:19:43,095 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-19 17:19:43,095 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-19 17:19:43,100 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-19 17:19:43,100 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:19:43" (1/1) ...
[2024-11-19 17:19:43,101 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0e31c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43, skipping insertion in model container
[2024-11-19 17:19:43,103 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:19:43" (1/1) ...
[2024-11-19 17:19:43,143 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-19 17:19:43,421 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/Problem02_label46.c[18150,18163]
[2024-11-19 17:19:43,452 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 17:19:43,461 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-19 17:19:43,507 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/Problem02_label46.c[18150,18163]
[2024-11-19 17:19:43,517 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 17:19:43,531 INFO  L204         MainTranslator]: Completed translation
[2024-11-19 17:19:43,533 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43 WrapperNode
[2024-11-19 17:19:43,533 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-19 17:19:43,534 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-19 17:19:43,534 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-19 17:19:43,534 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-19 17:19:43,539 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43" (1/1) ...
[2024-11-19 17:19:43,551 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43" (1/1) ...
[2024-11-19 17:19:43,593 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669
[2024-11-19 17:19:43,593 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-19 17:19:43,594 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-19 17:19:43,594 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-19 17:19:43,594 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-19 17:19:43,602 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43" (1/1) ...
[2024-11-19 17:19:43,603 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43" (1/1) ...
[2024-11-19 17:19:43,606 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43" (1/1) ...
[2024-11-19 17:19:43,626 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-19 17:19:43,629 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43" (1/1) ...
[2024-11-19 17:19:43,629 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43" (1/1) ...
[2024-11-19 17:19:43,639 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43" (1/1) ...
[2024-11-19 17:19:43,651 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43" (1/1) ...
[2024-11-19 17:19:43,659 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43" (1/1) ...
[2024-11-19 17:19:43,664 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43" (1/1) ...
[2024-11-19 17:19:43,670 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-19 17:19:43,672 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-19 17:19:43,672 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-19 17:19:43,672 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-19 17:19:43,672 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43" (1/1) ...
[2024-11-19 17:19:43,676 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 17:19:43,684 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 17:19:43,696 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-19 17:19:43,701 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-19 17:19:43,733 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-19 17:19:43,734 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-19 17:19:43,734 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-19 17:19:43,734 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-19 17:19:43,788 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-19 17:19:43,789 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-19 17:19:44,562 INFO  L?                        ?]: Removed 84 outVars from TransFormulas that were not future-live.
[2024-11-19 17:19:44,562 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-19 17:19:44,580 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-19 17:19:44,581 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-19 17:19:44,581 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:19:44 BoogieIcfgContainer
[2024-11-19 17:19:44,581 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-19 17:19:44,583 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-19 17:19:44,583 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-19 17:19:44,586 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-19 17:19:44,587 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:19:43" (1/3) ...
[2024-11-19 17:19:44,587 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3362c6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:19:44, skipping insertion in model container
[2024-11-19 17:19:44,587 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:43" (2/3) ...
[2024-11-19 17:19:44,587 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3362c6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:19:44, skipping insertion in model container
[2024-11-19 17:19:44,587 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:19:44" (3/3) ...
[2024-11-19 17:19:44,588 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem02_label46.c
[2024-11-19 17:19:44,600 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-19 17:19:44,601 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-19 17:19:44,655 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-19 17:19:44,660 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;@6a66c223, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-19 17:19:44,660 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-19 17:19:44,664 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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-19 17:19:44,672 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-19 17:19:44,672 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:19:44,673 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]
[2024-11-19 17:19:44,673 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:19:44,677 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:19:44,677 INFO  L85        PathProgramCache]: Analyzing trace with hash 1952388485, now seen corresponding path program 1 times
[2024-11-19 17:19:44,683 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:19:44,684 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349432740]
[2024-11-19 17:19:44,684 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:19:44,684 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:19:44,833 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:19:45,098 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-19 17:19:45,098 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:19:45,098 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349432740]
[2024-11-19 17:19:45,099 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349432740] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:19:45,099 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:19:45,099 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 17:19:45,100 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103742212]
[2024-11-19 17:19:45,101 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:19:45,105 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:19:45,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:19:45,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:19:45,121 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:19:45,123 INFO  L87              Difference]: Start difference. First operand  has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 17:19:45,731 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:19:45,731 INFO  L93              Difference]: Finished difference Result 600 states and 1037 transitions.
[2024-11-19 17:19:45,732 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:19:45,733 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112
[2024-11-19 17:19:45,734 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:19:45,763 INFO  L225             Difference]: With dead ends: 600
[2024-11-19 17:19:45,763 INFO  L226             Difference]: Without dead ends: 309
[2024-11-19 17:19:45,766 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-19 17:19:45,770 INFO  L432           NwaCegarLoop]: 150 mSDtfsCounter, 54 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-19 17:19:45,772 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-19 17:19:45,785 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 309 states.
[2024-11-19 17:19:45,805 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307.
[2024-11-19 17:19:45,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 0 states have call successors, (0), 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-19 17:19:45,807 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions.
[2024-11-19 17:19:45,808 INFO  L78                 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 112
[2024-11-19 17:19:45,809 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:19:45,809 INFO  L471      AbstractCegarLoop]: Abstraction has 307 states and 407 transitions.
[2024-11-19 17:19:45,809 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 17:19:45,809 INFO  L276                IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions.
[2024-11-19 17:19:45,811 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2024-11-19 17:19:45,811 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:19:45,811 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 17:19:45,811 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-19 17:19:45,811 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:19:45,812 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:19:45,812 INFO  L85        PathProgramCache]: Analyzing trace with hash 1368779408, now seen corresponding path program 1 times
[2024-11-19 17:19:45,812 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:19:45,812 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949324110]
[2024-11-19 17:19:45,812 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:19:45,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:19:45,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:19:45,960 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 17:19:45,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:19:45,961 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949324110]
[2024-11-19 17:19:45,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949324110] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:19:45,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:19:45,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 17:19:45,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587880810]
[2024-11-19 17:19:45,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:19:45,963 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:19:45,965 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:19:45,965 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:19:45,966 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:19:45,967 INFO  L87              Difference]: Start difference. First operand 307 states and 407 transitions. Second operand  has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-19 17:19:46,314 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:19:46,315 INFO  L93              Difference]: Finished difference Result 895 states and 1186 transitions.
[2024-11-19 17:19:46,315 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:19:46,315 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117
[2024-11-19 17:19:46,316 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:19:46,318 INFO  L225             Difference]: With dead ends: 895
[2024-11-19 17:19:46,318 INFO  L226             Difference]: Without dead ends: 590
[2024-11-19 17:19:46,319 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-19 17:19:46,320 INFO  L432           NwaCegarLoop]: 51 mSDtfsCounter, 93 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-19 17:19:46,320 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 61 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-19 17:19:46,321 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 590 states.
[2024-11-19 17:19:46,335 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590.
[2024-11-19 17:19:46,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 590 states, 589 states have (on average 1.2869269949066213) internal successors, (758), 589 states have internal predecessors, (758), 0 states have call successors, (0), 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-19 17:19:46,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 758 transitions.
[2024-11-19 17:19:46,338 INFO  L78                 Accepts]: Start accepts. Automaton has 590 states and 758 transitions. Word has length 117
[2024-11-19 17:19:46,338 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:19:46,338 INFO  L471      AbstractCegarLoop]: Abstraction has 590 states and 758 transitions.
[2024-11-19 17:19:46,338 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-19 17:19:46,338 INFO  L276                IsEmpty]: Start isEmpty. Operand 590 states and 758 transitions.
[2024-11-19 17:19:46,340 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2024-11-19 17:19:46,340 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:19:46,341 INFO  L215           NwaCegarLoop]: trace histogram [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]
[2024-11-19 17:19:46,341 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-19 17:19:46,341 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:19:46,341 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:19:46,342 INFO  L85        PathProgramCache]: Analyzing trace with hash 2115422843, now seen corresponding path program 1 times
[2024-11-19 17:19:46,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:19:46,342 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522936060]
[2024-11-19 17:19:46,342 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:19:46,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:19:46,361 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:19:46,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 17:19:46,481 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:19:46,481 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522936060]
[2024-11-19 17:19:46,481 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522936060] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:19:46,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:19:46,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 17:19:46,482 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946228453]
[2024-11-19 17:19:46,482 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:19:46,482 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:19:46,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:19:46,483 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:19:46,483 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:19:46,483 INFO  L87              Difference]: Start difference. First operand 590 states and 758 transitions. Second operand  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 17:19:46,834 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:19:46,834 INFO  L93              Difference]: Finished difference Result 1460 states and 1934 transitions.
[2024-11-19 17:19:46,834 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:19:46,835 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121
[2024-11-19 17:19:46,835 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:19:46,837 INFO  L225             Difference]: With dead ends: 1460
[2024-11-19 17:19:46,838 INFO  L226             Difference]: Without dead ends: 872
[2024-11-19 17:19:46,839 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-19 17:19:46,839 INFO  L432           NwaCegarLoop]: 236 mSDtfsCounter, 145 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-19 17:19:46,840 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 251 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-19 17:19:46,841 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 872 states.
[2024-11-19 17:19:46,856 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 871.
[2024-11-19 17:19:46,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 871 states, 870 states have (on average 1.2298850574712643) internal successors, (1070), 870 states have internal predecessors, (1070), 0 states have call successors, (0), 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-19 17:19:46,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1070 transitions.
[2024-11-19 17:19:46,859 INFO  L78                 Accepts]: Start accepts. Automaton has 871 states and 1070 transitions. Word has length 121
[2024-11-19 17:19:46,859 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:19:46,859 INFO  L471      AbstractCegarLoop]: Abstraction has 871 states and 1070 transitions.
[2024-11-19 17:19:46,860 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 17:19:46,860 INFO  L276                IsEmpty]: Start isEmpty. Operand 871 states and 1070 transitions.
[2024-11-19 17:19:46,861 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-11-19 17:19:46,861 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:19:46,861 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 17:19:46,862 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-19 17:19:46,862 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:19:46,862 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:19:46,862 INFO  L85        PathProgramCache]: Analyzing trace with hash 1149060337, now seen corresponding path program 1 times
[2024-11-19 17:19:46,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:19:46,862 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484938760]
[2024-11-19 17:19:46,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:19:46,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:19:46,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:19:47,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 17:19:47,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:19:47,012 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484938760]
[2024-11-19 17:19:47,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484938760] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:19:47,013 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:19:47,013 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 17:19:47,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694078919]
[2024-11-19 17:19:47,013 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:19:47,014 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:19:47,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:19:47,014 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:19:47,014 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:19:47,015 INFO  L87              Difference]: Start difference. First operand 871 states and 1070 transitions. Second operand  has 3 states, 3 states have (on average 41.666666666666664) 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-19 17:19:47,410 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:19:47,410 INFO  L93              Difference]: Finished difference Result 2163 states and 2654 transitions.
[2024-11-19 17:19:47,410 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:19:47,411 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.666666666666664) 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-19 17:19:47,411 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:19:47,414 INFO  L225             Difference]: With dead ends: 2163
[2024-11-19 17:19:47,414 INFO  L226             Difference]: Without dead ends: 1294
[2024-11-19 17:19:47,415 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-19 17:19:47,416 INFO  L432           NwaCegarLoop]: 250 mSDtfsCounter, 143 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-19 17:19:47,416 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 268 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-19 17:19:47,418 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1294 states.
[2024-11-19 17:19:47,427 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1151.
[2024-11-19 17:19:47,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1151 states, 1150 states have (on average 1.1956521739130435) internal successors, (1375), 1150 states have internal predecessors, (1375), 0 states have call successors, (0), 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-19 17:19:47,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1375 transitions.
[2024-11-19 17:19:47,430 INFO  L78                 Accepts]: Start accepts. Automaton has 1151 states and 1375 transitions. Word has length 125
[2024-11-19 17:19:47,430 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:19:47,430 INFO  L471      AbstractCegarLoop]: Abstraction has 1151 states and 1375 transitions.
[2024-11-19 17:19:47,431 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.666666666666664) 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-19 17:19:47,431 INFO  L276                IsEmpty]: Start isEmpty. Operand 1151 states and 1375 transitions.
[2024-11-19 17:19:47,432 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2024-11-19 17:19:47,433 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:19:47,433 INFO  L215           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-19 17:19:47,433 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-19 17:19:47,433 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:19:47,433 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:19:47,434 INFO  L85        PathProgramCache]: Analyzing trace with hash -1994243904, now seen corresponding path program 1 times
[2024-11-19 17:19:47,434 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:19:47,434 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147474680]
[2024-11-19 17:19:47,434 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:19:47,434 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:19:47,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:19:47,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-19 17:19:47,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:19:47,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147474680]
[2024-11-19 17:19:47,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147474680] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:19:47,491 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:19:47,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 17:19:47,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694945934]
[2024-11-19 17:19:47,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:19:47,493 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:19:47,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:19:47,494 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:19:47,494 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:19:47,494 INFO  L87              Difference]: Start difference. First operand 1151 states and 1375 transitions. Second operand  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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-19 17:19:47,834 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:19:47,835 INFO  L93              Difference]: Finished difference Result 3141 states and 3776 transitions.
[2024-11-19 17:19:47,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:19:47,835 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 133
[2024-11-19 17:19:47,836 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:19:47,841 INFO  L225             Difference]: With dead ends: 3141
[2024-11-19 17:19:47,842 INFO  L226             Difference]: Without dead ends: 1992
[2024-11-19 17:19:47,843 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-19 17:19:47,845 INFO  L432           NwaCegarLoop]: 67 mSDtfsCounter, 180 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-19 17:19:47,845 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 81 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-19 17:19:47,847 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1992 states.
[2024-11-19 17:19:47,869 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1992.
[2024-11-19 17:19:47,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1992 states, 1991 states have (on average 1.1662481165243597) internal successors, (2322), 1991 states have internal predecessors, (2322), 0 states have call successors, (0), 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-19 17:19:47,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2322 transitions.
[2024-11-19 17:19:47,875 INFO  L78                 Accepts]: Start accepts. Automaton has 1992 states and 2322 transitions. Word has length 133
[2024-11-19 17:19:47,876 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:19:47,876 INFO  L471      AbstractCegarLoop]: Abstraction has 1992 states and 2322 transitions.
[2024-11-19 17:19:47,876 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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-19 17:19:47,877 INFO  L276                IsEmpty]: Start isEmpty. Operand 1992 states and 2322 transitions.
[2024-11-19 17:19:47,879 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 140
[2024-11-19 17:19:47,880 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:19:47,880 INFO  L215           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 17:19:47,880 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-19 17:19:47,880 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:19:47,880 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:19:47,881 INFO  L85        PathProgramCache]: Analyzing trace with hash -1930928697, now seen corresponding path program 1 times
[2024-11-19 17:19:47,881 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:19:47,881 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788462760]
[2024-11-19 17:19:47,881 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:19:47,881 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:19:47,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:19:48,044 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-19 17:19:48,044 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:19:48,045 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788462760]
[2024-11-19 17:19:48,045 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788462760] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:19:48,045 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:19:48,045 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 17:19:48,045 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548155259]
[2024-11-19 17:19:48,045 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:19:48,045 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:19:48,046 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:19:48,046 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:19:48,046 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:19:48,046 INFO  L87              Difference]: Start difference. First operand 1992 states and 2322 transitions. Second operand  has 3 states, 3 states have (on average 44.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-19 17:19:48,380 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:19:48,380 INFO  L93              Difference]: Finished difference Result 3982 states and 4642 transitions.
[2024-11-19 17:19:48,381 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:19:48,381 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.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 139
[2024-11-19 17:19:48,381 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:19:48,386 INFO  L225             Difference]: With dead ends: 3982
[2024-11-19 17:19:48,386 INFO  L226             Difference]: Without dead ends: 1992
[2024-11-19 17:19:48,388 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-19 17:19:48,388 INFO  L432           NwaCegarLoop]: 224 mSDtfsCounter, 52 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-19 17:19:48,389 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 244 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-19 17:19:48,390 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1992 states.
[2024-11-19 17:19:48,405 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1572.
[2024-11-19 17:19:48,407 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1572 states, 1571 states have (on average 1.1133036282622533) internal successors, (1749), 1571 states have internal predecessors, (1749), 0 states have call successors, (0), 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-19 17:19:48,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 1749 transitions.
[2024-11-19 17:19:48,411 INFO  L78                 Accepts]: Start accepts. Automaton has 1572 states and 1749 transitions. Word has length 139
[2024-11-19 17:19:48,412 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:19:48,412 INFO  L471      AbstractCegarLoop]: Abstraction has 1572 states and 1749 transitions.
[2024-11-19 17:19:48,412 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.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-19 17:19:48,412 INFO  L276                IsEmpty]: Start isEmpty. Operand 1572 states and 1749 transitions.
[2024-11-19 17:19:48,415 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 147
[2024-11-19 17:19:48,415 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:19:48,415 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:19:48,415 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-19 17:19:48,416 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:19:48,416 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:19:48,416 INFO  L85        PathProgramCache]: Analyzing trace with hash 2020686227, now seen corresponding path program 1 times
[2024-11-19 17:19:48,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:19:48,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701153895]
[2024-11-19 17:19:48,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:19:48,417 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:19:48,439 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:19:48,625 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-19 17:19:48,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:19:48,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701153895]
[2024-11-19 17:19:48,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701153895] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:19:48,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:19:48,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 17:19:48,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412079969]
[2024-11-19 17:19:48,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:19:48,626 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 17:19:48,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:19:48,627 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 17:19:48,627 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 17:19:48,627 INFO  L87              Difference]: Start difference. First operand 1572 states and 1749 transitions. Second operand  has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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-19 17:19:49,127 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:19:49,128 INFO  L93              Difference]: Finished difference Result 3499 states and 3946 transitions.
[2024-11-19 17:19:49,128 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 17:19:49,128 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146
[2024-11-19 17:19:49,129 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:19:49,133 INFO  L225             Difference]: With dead ends: 3499
[2024-11-19 17:19:49,133 INFO  L226             Difference]: Without dead ends: 1846
[2024-11-19 17:19:49,134 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-19 17:19:49,135 INFO  L432           NwaCegarLoop]: 60 mSDtfsCounter, 144 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-19 17:19:49,135 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 87 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-19 17:19:49,136 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1846 states.
[2024-11-19 17:19:49,150 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1566.
[2024-11-19 17:19:49,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1566 states, 1565 states have (on average 1.100958466453674) internal successors, (1723), 1565 states have internal predecessors, (1723), 0 states have call successors, (0), 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-19 17:19:49,154 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 1723 transitions.
[2024-11-19 17:19:49,155 INFO  L78                 Accepts]: Start accepts. Automaton has 1566 states and 1723 transitions. Word has length 146
[2024-11-19 17:19:49,155 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:19:49,155 INFO  L471      AbstractCegarLoop]: Abstraction has 1566 states and 1723 transitions.
[2024-11-19 17:19:49,155 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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-19 17:19:49,155 INFO  L276                IsEmpty]: Start isEmpty. Operand 1566 states and 1723 transitions.
[2024-11-19 17:19:49,157 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2024-11-19 17:19:49,157 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:19:49,158 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 17:19:49,158 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-19 17:19:49,158 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:19:49,158 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:19:49,158 INFO  L85        PathProgramCache]: Analyzing trace with hash -683765611, now seen corresponding path program 1 times
[2024-11-19 17:19:49,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:19:49,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75479380]
[2024-11-19 17:19:49,159 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:19:49,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:19:49,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:19:49,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 87 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2024-11-19 17:19:49,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:19:49,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75479380]
[2024-11-19 17:19:49,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75479380] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:19:49,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:19:49,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 17:19:49,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570336308]
[2024-11-19 17:19:49,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:19:49,241 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:19:49,241 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:19:49,242 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:19:49,242 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:19:49,242 INFO  L87              Difference]: Start difference. First operand 1566 states and 1723 transitions. Second operand  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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-19 17:19:49,529 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:19:49,529 INFO  L93              Difference]: Finished difference Result 3272 states and 3592 transitions.
[2024-11-19 17:19:49,530 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:19:49,530 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 168
[2024-11-19 17:19:49,530 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:19:49,535 INFO  L225             Difference]: With dead ends: 3272
[2024-11-19 17:19:49,535 INFO  L226             Difference]: Without dead ends: 1708
[2024-11-19 17:19:49,537 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-19 17:19:49,537 INFO  L432           NwaCegarLoop]: 35 mSDtfsCounter, 150 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-19 17:19:49,538 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 41 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-19 17:19:49,540 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1708 states.
[2024-11-19 17:19:49,553 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1566.
[2024-11-19 17:19:49,555 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1566 states, 1565 states have (on average 1.0817891373801918) internal successors, (1693), 1565 states have internal predecessors, (1693), 0 states have call successors, (0), 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-19 17:19:49,557 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 1693 transitions.
[2024-11-19 17:19:49,557 INFO  L78                 Accepts]: Start accepts. Automaton has 1566 states and 1693 transitions. Word has length 168
[2024-11-19 17:19:49,557 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:19:49,557 INFO  L471      AbstractCegarLoop]: Abstraction has 1566 states and 1693 transitions.
[2024-11-19 17:19:49,558 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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-19 17:19:49,558 INFO  L276                IsEmpty]: Start isEmpty. Operand 1566 states and 1693 transitions.
[2024-11-19 17:19:49,560 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2024-11-19 17:19:49,560 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:19:49,560 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:19:49,560 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-19 17:19:49,560 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:19:49,561 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:19:49,561 INFO  L85        PathProgramCache]: Analyzing trace with hash 77820767, now seen corresponding path program 1 times
[2024-11-19 17:19:49,561 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:19:49,561 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660224510]
[2024-11-19 17:19:49,561 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:19:49,561 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:19:49,582 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:19:49,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 99 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2024-11-19 17:19:49,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:19:49,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660224510]
[2024-11-19 17:19:49,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660224510] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:19:49,625 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:19:49,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 17:19:49,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923825071]
[2024-11-19 17:19:49,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:19:49,625 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:19:49,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:19:49,626 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:19:49,626 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:19:49,626 INFO  L87              Difference]: Start difference. First operand 1566 states and 1693 transitions. Second operand  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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-19 17:19:49,926 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:19:49,926 INFO  L93              Difference]: Finished difference Result 3692 states and 4027 transitions.
[2024-11-19 17:19:49,926 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:19:49,926 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172
[2024-11-19 17:19:49,927 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:19:49,930 INFO  L225             Difference]: With dead ends: 3692
[2024-11-19 17:19:49,930 INFO  L226             Difference]: Without dead ends: 1988
[2024-11-19 17:19:49,932 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-19 17:19:49,932 INFO  L432           NwaCegarLoop]: 204 mSDtfsCounter, 140 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-19 17:19:49,933 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 223 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-19 17:19:49,934 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1988 states.
[2024-11-19 17:19:49,946 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1704.
[2024-11-19 17:19:49,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1704 states, 1703 states have (on average 1.082795067527892) internal successors, (1844), 1703 states have internal predecessors, (1844), 0 states have call successors, (0), 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-19 17:19:49,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 1844 transitions.
[2024-11-19 17:19:49,950 INFO  L78                 Accepts]: Start accepts. Automaton has 1704 states and 1844 transitions. Word has length 172
[2024-11-19 17:19:49,950 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:19:49,951 INFO  L471      AbstractCegarLoop]: Abstraction has 1704 states and 1844 transitions.
[2024-11-19 17:19:49,951 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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-19 17:19:49,951 INFO  L276                IsEmpty]: Start isEmpty. Operand 1704 states and 1844 transitions.
[2024-11-19 17:19:49,953 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 187
[2024-11-19 17:19:49,953 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:19:49,953 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:19:49,953 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-19 17:19:49,954 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:19:49,954 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:19:49,954 INFO  L85        PathProgramCache]: Analyzing trace with hash 324896925, now seen corresponding path program 1 times
[2024-11-19 17:19:49,954 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:19:49,954 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624781877]
[2024-11-19 17:19:49,954 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:19:49,954 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:19:49,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:19:50,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-19 17:19:50,170 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:19:50,170 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624781877]
[2024-11-19 17:19:50,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624781877] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:19:50,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:19:50,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 17:19:50,171 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791128344]
[2024-11-19 17:19:50,171 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:19:50,172 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-19 17:19:50,172 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:19:50,172 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-19 17:19:50,172 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-11-19 17:19:50,173 INFO  L87              Difference]: Start difference. First operand 1704 states and 1844 transitions. Second operand  has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 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-19 17:19:50,710 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:19:50,710 INFO  L93              Difference]: Finished difference Result 3492 states and 3785 transitions.
[2024-11-19 17:19:50,711 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 17:19:50,711 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 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-19 17:19:50,711 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:19:50,716 INFO  L225             Difference]: With dead ends: 3492
[2024-11-19 17:19:50,717 INFO  L226             Difference]: Without dead ends: 1844
[2024-11-19 17:19:50,718 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-11-19 17:19:50,719 INFO  L432           NwaCegarLoop]: 55 mSDtfsCounter, 184 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-19 17:19:50,720 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 88 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-19 17:19:50,721 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1844 states.
[2024-11-19 17:19:50,733 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1564.
[2024-11-19 17:19:50,734 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1564 states, 1563 states have (on average 1.073576455534229) internal successors, (1678), 1563 states have internal predecessors, (1678), 0 states have call successors, (0), 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-19 17:19:50,736 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1678 transitions.
[2024-11-19 17:19:50,737 INFO  L78                 Accepts]: Start accepts. Automaton has 1564 states and 1678 transitions. Word has length 186
[2024-11-19 17:19:50,737 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:19:50,737 INFO  L471      AbstractCegarLoop]: Abstraction has 1564 states and 1678 transitions.
[2024-11-19 17:19:50,737 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 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-19 17:19:50,737 INFO  L276                IsEmpty]: Start isEmpty. Operand 1564 states and 1678 transitions.
[2024-11-19 17:19:50,740 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2024-11-19 17:19:50,740 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:19:50,740 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:19:50,740 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-19 17:19:50,740 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:19:50,741 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:19:50,741 INFO  L85        PathProgramCache]: Analyzing trace with hash 1080570046, now seen corresponding path program 1 times
[2024-11-19 17:19:50,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:19:50,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164017435]
[2024-11-19 17:19:50,741 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:19:50,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:19:50,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:19:50,831 INFO  L134       CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-19 17:19:50,831 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:19:50,832 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164017435]
[2024-11-19 17:19:50,832 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164017435] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:19:50,832 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:19:50,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 17:19:50,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080577578]
[2024-11-19 17:19:50,832 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:19:50,832 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:19:50,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:19:50,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:19:50,833 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:19:50,833 INFO  L87              Difference]: Start difference. First operand 1564 states and 1678 transitions. Second operand  has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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-19 17:19:51,121 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:19:51,122 INFO  L93              Difference]: Finished difference Result 3684 states and 3962 transitions.
[2024-11-19 17:19:51,122 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:19:51,122 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 205
[2024-11-19 17:19:51,123 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:19:51,123 INFO  L225             Difference]: With dead ends: 3684
[2024-11-19 17:19:51,123 INFO  L226             Difference]: Without dead ends: 0
[2024-11-19 17:19:51,126 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-19 17:19:51,126 INFO  L432           NwaCegarLoop]: 218 mSDtfsCounter, 79 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-19 17:19:51,127 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 234 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-19 17:19:51,127 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-19 17:19:51,127 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-19 17:19:51,127 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-19 17:19:51,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-19 17:19:51,128 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 205
[2024-11-19 17:19:51,128 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:19:51,129 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-19 17:19:51,129 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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-19 17:19:51,129 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-19 17:19:51,129 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-19 17:19:51,131 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-19 17:19:51,132 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-19 17:19:51,134 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 17:19:51,136 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-19 17:19:51,399 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-19 17:19:51,424 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:19:51 BoogieIcfgContainer
[2024-11-19 17:19:51,425 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-19 17:19:51,426 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-19 17:19:51,426 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-19 17:19:51,427 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-19 17:19:51,427 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:19:44" (3/4) ...
[2024-11-19 17:19:51,430 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-19 17:19:51,452 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-19 17:19:51,453 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-19 17:19:51,454 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-19 17:19:51,455 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-19 17:19:51,597 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-19 17:19:51,597 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-19 17:19:51,597 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-19 17:19:51,598 INFO  L158              Benchmark]: Toolchain (without parser) took 8505.14ms. Allocated memory was 176.2MB in the beginning and 331.4MB in the end (delta: 155.2MB). Free memory was 106.4MB in the beginning and 256.6MB in the end (delta: -150.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB.
[2024-11-19 17:19:51,598 INFO  L158              Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 142.5MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-19 17:19:51,598 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 438.60ms. Allocated memory is still 176.2MB. Free memory was 105.9MB in the beginning and 127.0MB in the end (delta: -21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-19 17:19:51,599 INFO  L158              Benchmark]: Boogie Procedure Inliner took 59.58ms. Allocated memory is still 176.2MB. Free memory was 127.0MB in the beginning and 121.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-19 17:19:51,599 INFO  L158              Benchmark]: Boogie Preprocessor took 76.46ms. Allocated memory is still 176.2MB. Free memory was 121.2MB in the beginning and 115.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-19 17:19:51,599 INFO  L158              Benchmark]: RCFGBuilder took 909.77ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 115.7MB in the beginning and 162.0MB in the end (delta: -46.3MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB.
[2024-11-19 17:19:51,600 INFO  L158              Benchmark]: TraceAbstraction took 6842.83ms. Allocated memory was 228.6MB in the beginning and 331.4MB in the end (delta: 102.8MB). Free memory was 162.0MB in the beginning and 269.1MB in the end (delta: -107.2MB). Peak memory consumption was 131.8MB. Max. memory is 16.1GB.
[2024-11-19 17:19:51,600 INFO  L158              Benchmark]: Witness Printer took 171.07ms. Allocated memory is still 331.4MB. Free memory was 268.1MB in the beginning and 256.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-19 17:19:51,601 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.10ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 142.5MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 438.60ms. Allocated memory is still 176.2MB. Free memory was 105.9MB in the beginning and 127.0MB in the end (delta: -21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 59.58ms. Allocated memory is still 176.2MB. Free memory was 127.0MB in the beginning and 121.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 76.46ms. Allocated memory is still 176.2MB. Free memory was 121.2MB in the beginning and 115.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * RCFGBuilder took 909.77ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 115.7MB in the beginning and 162.0MB in the end (delta: -46.3MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 6842.83ms. Allocated memory was 228.6MB in the beginning and 331.4MB in the end (delta: 102.8MB). Free memory was 162.0MB in the beginning and 269.1MB in the end (delta: -107.2MB). Peak memory consumption was 131.8MB. Max. memory is 16.1GB.
 * Witness Printer took 171.07ms. Allocated memory is still 331.4MB. Free memory was 268.1MB in the beginning and 256.6MB in the end (delta: 11.5MB). 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: 518]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1364 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1364 mSDsluCounter, 1749 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 199 mSDsCounter, 815 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4645 IncrementalHoareTripleChecker+Invalid, 5460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 815 mSolverCounterUnsat, 1550 mSDtfsCounter, 4645 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1992occurred in iteration=5, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1552 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1624 NumberOfCodeBlocks, 1624 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1613 ConstructedInterpolants, 0 QuantifiedInterpolants, 6441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 512/512 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: 616]: Loop Invariant
    Derived loop invariant: (((((((((((a17 <= 7) && (a28 == 10)) && (a25 != 1)) && (a19 == 1)) || (((a25 == 1) && (a19 == 1)) && (a11 != 1))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || ((a19 == 0) && (a28 <= 10))) || (((((a17 == 8) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1)) && (a11 != 1))) || ((a19 == 0) && (a25 != 1))) || (((a25 == 1) && (a19 == 1)) && (a28 <= 7))) || (((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1)))
RESULT: Ultimate proved your program to be correct!
[2024-11-19 17:19:51,621 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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