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


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


Checking for ERROR reachability
Using default analysis
Version 3061b6dc
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label55.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash faf917cd0a1eaa2ad9dee590b3f946754d69847d6ec93638a854081a172b37da
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-18 09:37:49,777 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-18 09:37:49,839 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-18 09:37:49,843 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-18 09:37:49,843 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-18 09:37:49,879 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-18 09:37:49,882 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-18 09:37:49,882 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-18 09:37:49,883 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-18 09:37:49,884 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-18 09:37:49,884 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-18 09:37:49,885 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-18 09:37:49,885 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-18 09:37:49,885 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-18 09:37:49,885 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-18 09:37:49,887 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-18 09:37:49,888 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-18 09:37:49,888 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-18 09:37:49,888 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-18 09:37:49,888 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-18 09:37:49,888 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-18 09:37:49,892 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-18 09:37:49,893 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-18 09:37:49,893 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-18 09:37:49,893 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-18 09:37:49,893 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-18 09:37:49,893 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-18 09:37:49,893 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-18 09:37:49,893 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-18 09:37:49,893 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-18 09:37:49,894 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-18 09:37:49,894 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-18 09:37:49,894 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-18 09:37:49,894 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-18 09:37:49,894 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-18 09:37:49,894 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-18 09:37:49,894 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-18 09:37:49,895 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-18 09:37:49,895 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-18 09:37:49,895 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-18 09:37:49,895 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-18 09:37:49,899 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-18 09:37:49,899 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 -> faf917cd0a1eaa2ad9dee590b3f946754d69847d6ec93638a854081a172b37da
[2024-11-18 09:37:50,075 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-18 09:37:50,108 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-18 09:37:50,111 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-18 09:37:50,112 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-18 09:37:50,112 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-18 09:37:50,113 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label55.c
[2024-11-18 09:37:51,620 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-18 09:37:51,838 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-18 09:37:51,839 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label55.c
[2024-11-18 09:37:51,853 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b79c05d1/3ceb6a46b88a421f824b513da716bf8d/FLAG9663c5b75
[2024-11-18 09:37:51,871 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b79c05d1/3ceb6a46b88a421f824b513da716bf8d
[2024-11-18 09:37:51,874 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-18 09:37:51,876 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-18 09:37:51,876 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-18 09:37:51,877 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-18 09:37:51,881 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-18 09:37:51,881 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:37:51" (1/1) ...
[2024-11-18 09:37:51,884 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1526e9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:51, skipping insertion in model container
[2024-11-18 09:37:51,884 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:37:51" (1/1) ...
[2024-11-18 09:37:51,927 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-18 09:37:52,334 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label55.c[19349,19362]
[2024-11-18 09:37:52,401 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-18 09:37:52,434 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-18 09:37:52,588 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label55.c[19349,19362]
[2024-11-18 09:37:52,607 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-18 09:37:52,650 INFO  L204         MainTranslator]: Completed translation
[2024-11-18 09:37:52,654 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:52 WrapperNode
[2024-11-18 09:37:52,654 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-18 09:37:52,656 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-18 09:37:52,656 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-18 09:37:52,656 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-18 09:37:52,667 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:52" (1/1) ...
[2024-11-18 09:37:52,695 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:52" (1/1) ...
[2024-11-18 09:37:52,773 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658
[2024-11-18 09:37:52,774 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-18 09:37:52,775 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-18 09:37:52,775 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-18 09:37:52,775 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-18 09:37:52,784 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:52" (1/1) ...
[2024-11-18 09:37:52,784 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:52" (1/1) ...
[2024-11-18 09:37:52,790 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:52" (1/1) ...
[2024-11-18 09:37:52,822 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-18 09:37:52,826 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:52" (1/1) ...
[2024-11-18 09:37:52,826 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:52" (1/1) ...
[2024-11-18 09:37:52,845 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:52" (1/1) ...
[2024-11-18 09:37:52,850 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:52" (1/1) ...
[2024-11-18 09:37:52,855 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:52" (1/1) ...
[2024-11-18 09:37:52,859 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:52" (1/1) ...
[2024-11-18 09:37:52,870 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-18 09:37:52,871 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-18 09:37:52,871 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-18 09:37:52,871 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-18 09:37:52,872 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:52" (1/1) ...
[2024-11-18 09:37:52,880 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-18 09:37:52,904 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 09:37:52,923 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-18 09:37:52,937 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-18 09:37:52,979 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-18 09:37:52,979 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-18 09:37:52,981 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-18 09:37:52,981 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-18 09:37:53,057 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-18 09:37:53,060 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-18 09:37:54,012 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2024-11-18 09:37:54,013 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-18 09:37:54,033 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-18 09:37:54,034 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-18 09:37:54,034 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:37:54 BoogieIcfgContainer
[2024-11-18 09:37:54,035 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-18 09:37:54,036 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-18 09:37:54,040 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-18 09:37:54,043 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-18 09:37:54,043 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:37:51" (1/3) ...
[2024-11-18 09:37:54,044 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac0a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:37:54, skipping insertion in model container
[2024-11-18 09:37:54,044 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:37:52" (2/3) ...
[2024-11-18 09:37:54,044 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac0a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:37:54, skipping insertion in model container
[2024-11-18 09:37:54,045 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:37:54" (3/3) ...
[2024-11-18 09:37:54,046 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem01_label55.c
[2024-11-18 09:37:54,061 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-18 09:37:54,061 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-18 09:37:54,143 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-18 09:37:54,150 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;@b39eea6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-18 09:37:54,151 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-18 09:37:54,156 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 09:37:54,168 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-11-18 09:37:54,169 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:54,171 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]
[2024-11-18 09:37:54,171 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:54,177 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:54,177 INFO  L85        PathProgramCache]: Analyzing trace with hash -568054802, now seen corresponding path program 1 times
[2024-11-18 09:37:54,185 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:54,185 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165547710]
[2024-11-18 09:37:54,185 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:54,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:54,404 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:54,727 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-18 09:37:54,727 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:54,727 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165547710]
[2024-11-18 09:37:54,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165547710] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:54,728 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:54,728 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 09:37:54,730 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507112332]
[2024-11-18 09:37:54,731 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:54,736 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:37:54,737 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:54,757 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:37:54,758 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:37:54,761 INFO  L87              Difference]: Start difference. First operand  has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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-18 09:37:55,301 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:55,301 INFO  L93              Difference]: Finished difference Result 528 states and 915 transitions.
[2024-11-18 09:37:55,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:37:55,304 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111
[2024-11-18 09:37:55,305 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:55,313 INFO  L225             Difference]: With dead ends: 528
[2024-11-18 09:37:55,313 INFO  L226             Difference]: Without dead ends: 266
[2024-11-18 09:37:55,316 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-18 09:37:55,319 INFO  L432           NwaCegarLoop]: 36 mSDtfsCounter, 84 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:55,320 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 44 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-18 09:37:55,338 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2024-11-18 09:37:55,359 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266.
[2024-11-18 09:37:55,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 266 states, 265 states have (on average 1.4792452830188678) internal successors, (392), 265 states have internal predecessors, (392), 0 states have call successors, (0), 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-18 09:37:55,363 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 392 transitions.
[2024-11-18 09:37:55,365 INFO  L78                 Accepts]: Start accepts. Automaton has 266 states and 392 transitions. Word has length 111
[2024-11-18 09:37:55,365 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:55,366 INFO  L471      AbstractCegarLoop]: Abstraction has 266 states and 392 transitions.
[2024-11-18 09:37:55,367 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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-18 09:37:55,367 INFO  L276                IsEmpty]: Start isEmpty. Operand 266 states and 392 transitions.
[2024-11-18 09:37:55,370 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2024-11-18 09:37:55,371 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:55,372 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]
[2024-11-18 09:37:55,372 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-18 09:37:55,372 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:55,373 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:55,373 INFO  L85        PathProgramCache]: Analyzing trace with hash -163687658, now seen corresponding path program 1 times
[2024-11-18 09:37:55,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:55,374 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061691915]
[2024-11-18 09:37:55,374 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:55,374 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:55,407 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:55,502 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-18 09:37:55,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:55,503 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061691915]
[2024-11-18 09:37:55,503 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061691915] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:55,503 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:55,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 09:37:55,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245178436]
[2024-11-18 09:37:55,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:55,506 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:37:55,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:55,507 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:37:55,507 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:37:55,507 INFO  L87              Difference]: Start difference. First operand 266 states and 392 transitions. Second operand  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 09:37:55,859 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:55,860 INFO  L93              Difference]: Finished difference Result 792 states and 1171 transitions.
[2024-11-18 09:37:55,860 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:37:55,860 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116
[2024-11-18 09:37:55,861 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:55,863 INFO  L225             Difference]: With dead ends: 792
[2024-11-18 09:37:55,863 INFO  L226             Difference]: Without dead ends: 528
[2024-11-18 09:37:55,864 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-18 09:37:55,865 INFO  L432           NwaCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:55,865 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 29 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-18 09:37:55,867 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2024-11-18 09:37:55,889 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528.
[2024-11-18 09:37:55,890 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 528 states, 527 states have (on average 1.413662239089184) internal successors, (745), 527 states have internal predecessors, (745), 0 states have call successors, (0), 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-18 09:37:55,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 745 transitions.
[2024-11-18 09:37:55,892 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 745 transitions. Word has length 116
[2024-11-18 09:37:55,892 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:55,892 INFO  L471      AbstractCegarLoop]: Abstraction has 528 states and 745 transitions.
[2024-11-18 09:37:55,893 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 09:37:55,893 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 745 transitions.
[2024-11-18 09:37:55,897 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2024-11-18 09:37:55,897 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:55,897 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 09:37:55,898 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-18 09:37:55,898 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:55,898 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:55,898 INFO  L85        PathProgramCache]: Analyzing trace with hash -390312305, now seen corresponding path program 1 times
[2024-11-18 09:37:55,899 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:55,899 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329110794]
[2024-11-18 09:37:55,899 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:55,899 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:55,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:56,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 09:37:56,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:56,194 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329110794]
[2024-11-18 09:37:56,194 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329110794] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:56,194 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:56,194 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 09:37:56,194 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857051773]
[2024-11-18 09:37:56,194 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:56,195 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:37:56,195 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:56,195 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:37:56,196 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:37:56,196 INFO  L87              Difference]: Start difference. First operand 528 states and 745 transitions. Second operand  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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-18 09:37:56,517 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:56,518 INFO  L93              Difference]: Finished difference Result 1447 states and 2032 transitions.
[2024-11-18 09:37:56,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:37:56,518 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 126
[2024-11-18 09:37:56,519 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:56,521 INFO  L225             Difference]: With dead ends: 1447
[2024-11-18 09:37:56,521 INFO  L226             Difference]: Without dead ends: 921
[2024-11-18 09:37:56,522 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-18 09:37:56,523 INFO  L432           NwaCegarLoop]: 51 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:56,523 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 56 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-18 09:37:56,525 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 921 states.
[2024-11-18 09:37:56,565 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 790.
[2024-11-18 09:37:56,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 790 states, 789 states have (on average 1.3219264892268694) internal successors, (1043), 789 states have internal predecessors, (1043), 0 states have call successors, (0), 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-18 09:37:56,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1043 transitions.
[2024-11-18 09:37:56,569 INFO  L78                 Accepts]: Start accepts. Automaton has 790 states and 1043 transitions. Word has length 126
[2024-11-18 09:37:56,570 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:56,570 INFO  L471      AbstractCegarLoop]: Abstraction has 790 states and 1043 transitions.
[2024-11-18 09:37:56,570 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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-18 09:37:56,570 INFO  L276                IsEmpty]: Start isEmpty. Operand 790 states and 1043 transitions.
[2024-11-18 09:37:56,573 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2024-11-18 09:37:56,573 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:56,573 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:37:56,574 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-18 09:37:56,574 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:56,574 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:56,574 INFO  L85        PathProgramCache]: Analyzing trace with hash 1566292639, now seen corresponding path program 1 times
[2024-11-18 09:37:56,574 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:56,575 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888970200]
[2024-11-18 09:37:56,575 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:56,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:56,606 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:56,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-18 09:37:56,723 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:56,723 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888970200]
[2024-11-18 09:37:56,723 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888970200] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:56,725 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:56,725 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 09:37:56,725 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907253478]
[2024-11-18 09:37:56,725 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:56,726 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:37:56,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:56,726 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:37:56,726 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:37:56,726 INFO  L87              Difference]: Start difference. First operand 790 states and 1043 transitions. Second operand  has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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-18 09:37:57,110 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:57,110 INFO  L93              Difference]: Finished difference Result 1840 states and 2437 transitions.
[2024-11-18 09:37:57,111 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:37:57,111 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127
[2024-11-18 09:37:57,111 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:57,114 INFO  L225             Difference]: With dead ends: 1840
[2024-11-18 09:37:57,118 INFO  L226             Difference]: Without dead ends: 1052
[2024-11-18 09:37:57,124 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-18 09:37:57,125 INFO  L432           NwaCegarLoop]: 69 mSDtfsCounter, 127 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:57,125 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 74 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-18 09:37:57,130 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1052 states.
[2024-11-18 09:37:57,155 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921.
[2024-11-18 09:37:57,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 921 states, 920 states have (on average 1.2891304347826087) internal successors, (1186), 920 states have internal predecessors, (1186), 0 states have call successors, (0), 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-18 09:37:57,163 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1186 transitions.
[2024-11-18 09:37:57,167 INFO  L78                 Accepts]: Start accepts. Automaton has 921 states and 1186 transitions. Word has length 127
[2024-11-18 09:37:57,168 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:57,168 INFO  L471      AbstractCegarLoop]: Abstraction has 921 states and 1186 transitions.
[2024-11-18 09:37:57,168 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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-18 09:37:57,168 INFO  L276                IsEmpty]: Start isEmpty. Operand 921 states and 1186 transitions.
[2024-11-18 09:37:57,170 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2024-11-18 09:37:57,174 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:57,174 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 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]
[2024-11-18 09:37:57,175 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-18 09:37:57,176 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:57,176 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:57,176 INFO  L85        PathProgramCache]: Analyzing trace with hash 186858855, now seen corresponding path program 1 times
[2024-11-18 09:37:57,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:57,176 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326911967]
[2024-11-18 09:37:57,176 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:57,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:57,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:57,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-18 09:37:57,434 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:57,434 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326911967]
[2024-11-18 09:37:57,434 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326911967] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:57,434 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:57,434 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 09:37:57,434 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000897793]
[2024-11-18 09:37:57,434 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:57,435 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:37:57,435 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:57,435 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:37:57,435 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:37:57,435 INFO  L87              Difference]: Start difference. First operand 921 states and 1186 transitions. Second operand  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 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-18 09:37:57,929 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:57,929 INFO  L93              Difference]: Finished difference Result 2102 states and 2723 transitions.
[2024-11-18 09:37:57,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:37:57,930 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 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 131
[2024-11-18 09:37:57,930 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:57,933 INFO  L225             Difference]: With dead ends: 2102
[2024-11-18 09:37:57,936 INFO  L226             Difference]: Without dead ends: 1183
[2024-11-18 09:37:57,938 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-18 09:37:57,942 INFO  L432           NwaCegarLoop]: 56 mSDtfsCounter, 130 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:57,942 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 60 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-18 09:37:57,944 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1183 states.
[2024-11-18 09:37:57,975 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183.
[2024-11-18 09:37:57,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1183 states, 1182 states have (on average 1.2614213197969544) internal successors, (1491), 1182 states have internal predecessors, (1491), 0 states have call successors, (0), 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-18 09:37:57,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1491 transitions.
[2024-11-18 09:37:57,989 INFO  L78                 Accepts]: Start accepts. Automaton has 1183 states and 1491 transitions. Word has length 131
[2024-11-18 09:37:57,989 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:57,989 INFO  L471      AbstractCegarLoop]: Abstraction has 1183 states and 1491 transitions.
[2024-11-18 09:37:57,990 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 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-18 09:37:57,990 INFO  L276                IsEmpty]: Start isEmpty. Operand 1183 states and 1491 transitions.
[2024-11-18 09:37:57,992 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2024-11-18 09:37:57,993 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:57,994 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:37:57,994 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-18 09:37:57,994 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:57,995 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:57,995 INFO  L85        PathProgramCache]: Analyzing trace with hash -350047557, now seen corresponding path program 1 times
[2024-11-18 09:37:57,995 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:57,995 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120240627]
[2024-11-18 09:37:57,995 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:57,995 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:58,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:58,161 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-18 09:37:58,161 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:58,162 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120240627]
[2024-11-18 09:37:58,162 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120240627] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:58,162 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:58,162 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-18 09:37:58,162 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139659017]
[2024-11-18 09:37:58,162 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:58,163 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-18 09:37:58,163 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:58,163 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-18 09:37:58,163 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-18 09:37:58,163 INFO  L87              Difference]: Start difference. First operand 1183 states and 1491 transitions. Second operand  has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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-18 09:37:59,039 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:59,039 INFO  L93              Difference]: Finished difference Result 2888 states and 3588 transitions.
[2024-11-18 09:37:59,040 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-18 09:37:59,040 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 160
[2024-11-18 09:37:59,040 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:59,044 INFO  L225             Difference]: With dead ends: 2888
[2024-11-18 09:37:59,044 INFO  L226             Difference]: Without dead ends: 1576
[2024-11-18 09:37:59,045 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-18 09:37:59,046 INFO  L432           NwaCegarLoop]: 29 mSDtfsCounter, 274 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:59,046 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 39 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-18 09:37:59,048 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1576 states.
[2024-11-18 09:37:59,062 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576.
[2024-11-18 09:37:59,063 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1576 states, 1575 states have (on average 1.135873015873016) internal successors, (1789), 1575 states have internal predecessors, (1789), 0 states have call successors, (0), 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-18 09:37:59,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1789 transitions.
[2024-11-18 09:37:59,066 INFO  L78                 Accepts]: Start accepts. Automaton has 1576 states and 1789 transitions. Word has length 160
[2024-11-18 09:37:59,066 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:59,067 INFO  L471      AbstractCegarLoop]: Abstraction has 1576 states and 1789 transitions.
[2024-11-18 09:37:59,067 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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-18 09:37:59,067 INFO  L276                IsEmpty]: Start isEmpty. Operand 1576 states and 1789 transitions.
[2024-11-18 09:37:59,069 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2024-11-18 09:37:59,069 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:59,069 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-18 09:37:59,070 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-18 09:37:59,070 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:59,070 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:59,070 INFO  L85        PathProgramCache]: Analyzing trace with hash -917422874, now seen corresponding path program 1 times
[2024-11-18 09:37:59,071 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:59,071 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391267491]
[2024-11-18 09:37:59,071 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:59,071 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:59,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:59,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 86 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked.
[2024-11-18 09:37:59,255 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:59,255 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391267491]
[2024-11-18 09:37:59,255 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391267491] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:59,256 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:59,256 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-18 09:37:59,256 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689001060]
[2024-11-18 09:37:59,256 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:59,256 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-18 09:37:59,256 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:59,257 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-18 09:37:59,257 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-18 09:37:59,257 INFO  L87              Difference]: Start difference. First operand 1576 states and 1789 transitions. Second operand  has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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-18 09:37:59,694 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:37:59,695 INFO  L93              Difference]: Finished difference Result 3412 states and 3900 transitions.
[2024-11-18 09:37:59,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-18 09:37:59,695 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 177
[2024-11-18 09:37:59,696 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:37:59,700 INFO  L225             Difference]: With dead ends: 3412
[2024-11-18 09:37:59,700 INFO  L226             Difference]: Without dead ends: 1838
[2024-11-18 09:37:59,702 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-18 09:37:59,702 INFO  L432           NwaCegarLoop]: 34 mSDtfsCounter, 374 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-18 09:37:59,702 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 42 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-18 09:37:59,704 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2024-11-18 09:37:59,725 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838.
[2024-11-18 09:37:59,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1838 states, 1837 states have (on average 1.1377245508982037) internal successors, (2090), 1837 states have internal predecessors, (2090), 0 states have call successors, (0), 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-18 09:37:59,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2090 transitions.
[2024-11-18 09:37:59,730 INFO  L78                 Accepts]: Start accepts. Automaton has 1838 states and 2090 transitions. Word has length 177
[2024-11-18 09:37:59,730 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:37:59,730 INFO  L471      AbstractCegarLoop]: Abstraction has 1838 states and 2090 transitions.
[2024-11-18 09:37:59,730 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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-18 09:37:59,731 INFO  L276                IsEmpty]: Start isEmpty. Operand 1838 states and 2090 transitions.
[2024-11-18 09:37:59,733 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2024-11-18 09:37:59,733 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:37:59,734 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:37:59,734 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-18 09:37:59,734 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:37:59,734 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:37:59,735 INFO  L85        PathProgramCache]: Analyzing trace with hash 1781562584, now seen corresponding path program 1 times
[2024-11-18 09:37:59,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:37:59,735 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313035062]
[2024-11-18 09:37:59,735 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:37:59,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:37:59,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:37:59,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 95 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-18 09:37:59,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:37:59,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313035062]
[2024-11-18 09:37:59,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313035062] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:37:59,904 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:37:59,904 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-18 09:37:59,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347583052]
[2024-11-18 09:37:59,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:37:59,905 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-18 09:37:59,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:37:59,905 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-18 09:37:59,905 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-18 09:37:59,906 INFO  L87              Difference]: Start difference. First operand 1838 states and 2090 transitions. Second operand  has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 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-18 09:38:00,376 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:38:00,377 INFO  L93              Difference]: Finished difference Result 3936 states and 4451 transitions.
[2024-11-18 09:38:00,377 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-18 09:38:00,377 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 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 177
[2024-11-18 09:38:00,377 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:38:00,382 INFO  L225             Difference]: With dead ends: 3936
[2024-11-18 09:38:00,382 INFO  L226             Difference]: Without dead ends: 2100
[2024-11-18 09:38:00,384 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-18 09:38:00,384 INFO  L432           NwaCegarLoop]: 22 mSDtfsCounter, 222 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-18 09:38:00,385 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 32 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-18 09:38:00,386 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2100 states.
[2024-11-18 09:38:00,402 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838.
[2024-11-18 09:38:00,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1838 states, 1837 states have (on average 1.120304844855743) internal successors, (2058), 1837 states have internal predecessors, (2058), 0 states have call successors, (0), 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-18 09:38:00,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2058 transitions.
[2024-11-18 09:38:00,406 INFO  L78                 Accepts]: Start accepts. Automaton has 1838 states and 2058 transitions. Word has length 177
[2024-11-18 09:38:00,407 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:38:00,407 INFO  L471      AbstractCegarLoop]: Abstraction has 1838 states and 2058 transitions.
[2024-11-18 09:38:00,407 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 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-18 09:38:00,407 INFO  L276                IsEmpty]: Start isEmpty. Operand 1838 states and 2058 transitions.
[2024-11-18 09:38:00,409 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2024-11-18 09:38:00,409 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:38:00,410 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:38:00,410 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-18 09:38:00,410 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:38:00,410 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:38:00,410 INFO  L85        PathProgramCache]: Analyzing trace with hash -213833625, now seen corresponding path program 1 times
[2024-11-18 09:38:00,410 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:38:00,411 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813330484]
[2024-11-18 09:38:00,411 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:38:00,411 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:38:00,456 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:38:00,546 INFO  L134       CoverageAnalysis]: Checked inductivity of 119 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 09:38:00,546 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:38:00,546 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813330484]
[2024-11-18 09:38:00,546 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813330484] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:38:00,546 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:38:00,546 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-18 09:38:00,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193750110]
[2024-11-18 09:38:00,547 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:38:00,547 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:38:00,547 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:38:00,548 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:38:00,548 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:38:00,548 INFO  L87              Difference]: Start difference. First operand 1838 states and 2058 transitions. Second operand  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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-18 09:38:00,836 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:38:00,837 INFO  L93              Difference]: Finished difference Result 3936 states and 4387 transitions.
[2024-11-18 09:38:00,837 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:38:00,837 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 195
[2024-11-18 09:38:00,838 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:38:00,842 INFO  L225             Difference]: With dead ends: 3936
[2024-11-18 09:38:00,842 INFO  L226             Difference]: Without dead ends: 2100
[2024-11-18 09:38:00,844 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-18 09:38:00,845 INFO  L432           NwaCegarLoop]: 172 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-18 09:38:00,845 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 177 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-18 09:38:00,846 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2100 states.
[2024-11-18 09:38:00,866 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969.
[2024-11-18 09:38:00,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1969 states, 1968 states have (on average 1.0965447154471544) internal successors, (2158), 1968 states have internal predecessors, (2158), 0 states have call successors, (0), 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-18 09:38:00,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2158 transitions.
[2024-11-18 09:38:00,871 INFO  L78                 Accepts]: Start accepts. Automaton has 1969 states and 2158 transitions. Word has length 195
[2024-11-18 09:38:00,871 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:38:00,871 INFO  L471      AbstractCegarLoop]: Abstraction has 1969 states and 2158 transitions.
[2024-11-18 09:38:00,872 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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-18 09:38:00,872 INFO  L276                IsEmpty]: Start isEmpty. Operand 1969 states and 2158 transitions.
[2024-11-18 09:38:00,874 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 218
[2024-11-18 09:38:00,874 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:38:00,875 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 09:38:00,875 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-18 09:38:00,875 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:38:00,875 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:38:00,875 INFO  L85        PathProgramCache]: Analyzing trace with hash -1426363216, now seen corresponding path program 1 times
[2024-11-18 09:38:00,876 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:38:00,876 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237336307]
[2024-11-18 09:38:00,876 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:38:00,876 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:38:00,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:38:01,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked.
[2024-11-18 09:38:01,030 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:38:01,030 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237336307]
[2024-11-18 09:38:01,030 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237336307] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:38:01,030 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 09:38:01,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 09:38:01,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59210336]
[2024-11-18 09:38:01,030 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:38:01,031 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:38:01,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:38:01,031 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:38:01,031 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 09:38:01,032 INFO  L87              Difference]: Start difference. First operand 1969 states and 2158 transitions. Second operand  has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 09:38:01,329 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:38:01,329 INFO  L93              Difference]: Finished difference Result 2626 states and 2855 transitions.
[2024-11-18 09:38:01,329 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:38:01,330 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217
[2024-11-18 09:38:01,330 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:38:01,336 INFO  L225             Difference]: With dead ends: 2626
[2024-11-18 09:38:01,336 INFO  L226             Difference]: Without dead ends: 2624
[2024-11-18 09:38:01,336 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-18 09:38:01,337 INFO  L432           NwaCegarLoop]: 25 mSDtfsCounter, 42 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-18 09:38:01,337 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 30 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-18 09:38:01,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2624 states.
[2024-11-18 09:38:01,357 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1969.
[2024-11-18 09:38:01,359 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1969 states, 1968 states have (on average 1.0955284552845528) internal successors, (2156), 1968 states have internal predecessors, (2156), 0 states have call successors, (0), 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-18 09:38:01,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2156 transitions.
[2024-11-18 09:38:01,362 INFO  L78                 Accepts]: Start accepts. Automaton has 1969 states and 2156 transitions. Word has length 217
[2024-11-18 09:38:01,362 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:38:01,362 INFO  L471      AbstractCegarLoop]: Abstraction has 1969 states and 2156 transitions.
[2024-11-18 09:38:01,362 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 09:38:01,363 INFO  L276                IsEmpty]: Start isEmpty. Operand 1969 states and 2156 transitions.
[2024-11-18 09:38:01,366 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 282
[2024-11-18 09:38:01,366 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 09:38:01,366 INFO  L215           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-18 09:38:01,366 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-18 09:38:01,366 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 09:38:01,367 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 09:38:01,367 INFO  L85        PathProgramCache]: Analyzing trace with hash -1908530202, now seen corresponding path program 1 times
[2024-11-18 09:38:01,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 09:38:01,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459982116]
[2024-11-18 09:38:01,367 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:38:01,367 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 09:38:01,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:38:01,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 407 backedges. 256 proven. 142 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-11-18 09:38:01,899 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 09:38:01,899 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459982116]
[2024-11-18 09:38:01,899 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459982116] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-18 09:38:01,900 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462769335]
[2024-11-18 09:38:01,900 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 09:38:01,900 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 09:38:01,900 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 09:38:01,903 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-18 09:38:01,906 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-18 09:38:02,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 09:38:02,048 INFO  L255         TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-18 09:38:02,067 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 09:38:02,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 407 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked.
[2024-11-18 09:38:02,390 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-18 09:38:02,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462769335] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 09:38:02,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-18 09:38:02,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7
[2024-11-18 09:38:02,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338990002]
[2024-11-18 09:38:02,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 09:38:02,391 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 09:38:02,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 09:38:02,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 09:38:02,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-11-18 09:38:02,393 INFO  L87              Difference]: Start difference. First operand 1969 states and 2156 transitions. Second operand  has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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-18 09:38:02,689 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 09:38:02,689 INFO  L93              Difference]: Finished difference Result 4327 states and 4718 transitions.
[2024-11-18 09:38:02,689 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 09:38:02,690 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 281
[2024-11-18 09:38:02,690 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 09:38:02,690 INFO  L225             Difference]: With dead ends: 4327
[2024-11-18 09:38:02,690 INFO  L226             Difference]: Without dead ends: 0
[2024-11-18 09:38:02,694 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-11-18 09:38:02,694 INFO  L432           NwaCegarLoop]: 164 mSDtfsCounter, 28 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-18 09:38:02,695 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 169 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-18 09:38:02,695 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-18 09:38:02,695 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-18 09:38:02,695 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-18 09:38:02,695 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-18 09:38:02,696 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281
[2024-11-18 09:38:02,696 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 09:38:02,696 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-18 09:38:02,696 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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-18 09:38:02,696 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-18 09:38:02,696 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-18 09:38:02,699 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-18 09:38:02,718 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-18 09:38:02,900 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2024-11-18 09:38:02,903 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 09:38:02,904 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-18 09:38:03,057 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-18 09:38:03,071 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:38:03 BoogieIcfgContainer
[2024-11-18 09:38:03,072 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-18 09:38:03,072 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-18 09:38:03,073 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-18 09:38:03,073 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-18 09:38:03,074 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:37:54" (3/4) ...
[2024-11-18 09:38:03,076 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-18 09:38:03,093 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-18 09:38:03,094 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-18 09:38:03,095 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-18 09:38:03,096 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-18 09:38:03,224 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-18 09:38:03,224 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-18 09:38:03,224 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-18 09:38:03,225 INFO  L158              Benchmark]: Toolchain (without parser) took 11349.07ms. Allocated memory was 134.2MB in the beginning and 432.0MB in the end (delta: 297.8MB). Free memory was 60.8MB in the beginning and 214.3MB in the end (delta: -153.4MB). Peak memory consumption was 146.2MB. Max. memory is 16.1GB.
[2024-11-18 09:38:03,225 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-18 09:38:03,225 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 778.43ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 60.8MB in the beginning and 156.5MB in the end (delta: -95.6MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB.
[2024-11-18 09:38:03,225 INFO  L158              Benchmark]: Boogie Procedure Inliner took 118.56ms. Allocated memory is still 203.4MB. Free memory was 156.5MB in the beginning and 151.1MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-18 09:38:03,226 INFO  L158              Benchmark]: Boogie Preprocessor took 96.00ms. Allocated memory is still 203.4MB. Free memory was 151.1MB in the beginning and 144.9MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-18 09:38:03,227 INFO  L158              Benchmark]: RCFGBuilder took 1163.72ms. Allocated memory is still 203.4MB. Free memory was 144.9MB in the beginning and 132.6MB in the end (delta: 12.4MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB.
[2024-11-18 09:38:03,227 INFO  L158              Benchmark]: TraceAbstraction took 9035.33ms. Allocated memory was 203.4MB in the beginning and 432.0MB in the end (delta: 228.6MB). Free memory was 132.6MB in the beginning and 226.8MB in the end (delta: -94.2MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB.
[2024-11-18 09:38:03,227 INFO  L158              Benchmark]: Witness Printer took 151.96ms. Allocated memory is still 432.0MB. Free memory was 226.8MB in the beginning and 214.3MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-18 09:38:03,229 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 778.43ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 60.8MB in the beginning and 156.5MB in the end (delta: -95.6MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 118.56ms. Allocated memory is still 203.4MB. Free memory was 156.5MB in the beginning and 151.1MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 96.00ms. Allocated memory is still 203.4MB. Free memory was 151.1MB in the beginning and 144.9MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1163.72ms. Allocated memory is still 203.4MB. Free memory was 144.9MB in the beginning and 132.6MB in the end (delta: 12.4MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 9035.33ms. Allocated memory was 203.4MB in the beginning and 432.0MB in the end (delta: 228.6MB). Free memory was 132.6MB in the beginning and 226.8MB in the end (delta: -94.2MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB.
 * Witness Printer took 151.96ms. Allocated memory is still 432.0MB. Free memory was 226.8MB in the beginning and 214.3MB in the end (delta: 12.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: 519]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1663 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1663 mSDsluCounter, 752 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 815 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4228 IncrementalHoareTripleChecker+Invalid, 5043 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 815 mSolverCounterUnsat, 683 mSDtfsCounter, 4228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=9, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1310 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2099 NumberOfCodeBlocks, 2099 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2087 ConstructedInterpolants, 0 QuantifiedInterpolants, 5232 SizeOfPredicates, 0 NumberOfNonLiveVariables, 516 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1268/1410 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 593]: Loop Invariant
    Derived loop invariant: (((((a21 == 1) && (a16 <= 5)) || (a8 <= 13)) || ((a21 == 1) && (15 <= a8))) || ((a21 == 1) && (a20 == 1)))
RESULT: Ultimate proved your program to be correct!
[2024-11-18 09:38:03,253 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