/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_valuebound2.c


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


This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m
[2023-12-16 05:10:07,872 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-12-16 05:10:07,907 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2023-12-16 05:10:07,910 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-12-16 05:10:07,911 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-12-16 05:10:07,924 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-12-16 05:10:07,925 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-12-16 05:10:07,925 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-12-16 05:10:07,925 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-12-16 05:10:07,925 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2023-12-16 05:10:07,926 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-12-16 05:10:07,926 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-12-16 05:10:07,926 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-12-16 05:10:07,927 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-12-16 05:10:07,927 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-12-16 05:10:07,927 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-12-16 05:10:07,927 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-12-16 05:10:07,928 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-12-16 05:10:07,928 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-12-16 05:10:07,928 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-12-16 05:10:07,928 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-12-16 05:10:07,931 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-12-16 05:10:07,932 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-12-16 05:10:07,932 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-12-16 05:10:07,932 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2023-12-16 05:10:07,932 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-12-16 05:10:07,932 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-12-16 05:10:07,933 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-12-16 05:10:07,933 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-12-16 05:10:07,933 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-12-16 05:10:07,933 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2023-12-16 05:10:07,934 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-12-16 05:10:07,934 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-16 05:10:07,934 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-12-16 05:10:07,934 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-12-16 05:10:07,934 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-12-16 05:10:07,935 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-12-16 05:10:07,935 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-12-16 05:10:07,935 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-12-16 05:10:07,935 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-12-16 05:10:07,935 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-12-16 05:10:07,938 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-12-16 05:10:07,938 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-12-16 05:10:07,939 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: Use bitabs translation -> false
[2023-12-16 05:10:08,110 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-12-16 05:10:08,129 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-12-16 05:10:08,131 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-12-16 05:10:08,132 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-12-16 05:10:08,132 INFO  L274        PluginConnector]: CDTParser initialized
[2023-12-16 05:10:08,133 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_valuebound2.c
[2023-12-16 05:10:09,176 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-12-16 05:10:09,325 INFO  L384              CDTParser]: Found 1 translation units.
[2023-12-16 05:10:09,326 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_valuebound2.c
[2023-12-16 05:10:09,332 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ce81b5ba/aeb7264c0e1040fcb20af29282479c3b/FLAGbbd31ea5b
[2023-12-16 05:10:09,346 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ce81b5ba/aeb7264c0e1040fcb20af29282479c3b
[2023-12-16 05:10:09,348 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-12-16 05:10:09,349 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-12-16 05:10:09,352 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-12-16 05:10:09,352 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-12-16 05:10:09,355 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-12-16 05:10:09,355 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:10:09" (1/1) ...
[2023-12-16 05:10:09,356 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b33b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09, skipping insertion in model container
[2023-12-16 05:10:09,356 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:10:09" (1/1) ...
[2023-12-16 05:10:09,372 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-12-16 05:10:09,473 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_valuebound2.c[538,551]
[2023-12-16 05:10:09,484 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-16 05:10:09,490 INFO  L202         MainTranslator]: Completed pre-run
[2023-12-16 05:10:09,497 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_valuebound2.c[538,551]
[2023-12-16 05:10:09,503 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-16 05:10:09,511 INFO  L206         MainTranslator]: Completed translation
[2023-12-16 05:10:09,511 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09 WrapperNode
[2023-12-16 05:10:09,511 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-12-16 05:10:09,512 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-12-16 05:10:09,512 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-12-16 05:10:09,512 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-12-16 05:10:09,516 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09" (1/1) ...
[2023-12-16 05:10:09,520 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09" (1/1) ...
[2023-12-16 05:10:09,532 INFO  L138                Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56
[2023-12-16 05:10:09,532 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-12-16 05:10:09,532 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-12-16 05:10:09,532 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-12-16 05:10:09,532 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-12-16 05:10:09,538 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09" (1/1) ...
[2023-12-16 05:10:09,539 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09" (1/1) ...
[2023-12-16 05:10:09,540 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09" (1/1) ...
[2023-12-16 05:10:09,546 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].
[2023-12-16 05:10:09,546 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09" (1/1) ...
[2023-12-16 05:10:09,546 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09" (1/1) ...
[2023-12-16 05:10:09,548 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09" (1/1) ...
[2023-12-16 05:10:09,550 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09" (1/1) ...
[2023-12-16 05:10:09,551 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09" (1/1) ...
[2023-12-16 05:10:09,551 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09" (1/1) ...
[2023-12-16 05:10:09,552 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-12-16 05:10:09,553 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-12-16 05:10:09,553 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-12-16 05:10:09,553 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-12-16 05:10:09,554 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09" (1/1) ...
[2023-12-16 05:10:09,557 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-16 05:10:09,566 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 05:10:09,585 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)
[2023-12-16 05:10:09,599 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
[2023-12-16 05:10:09,617 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-12-16 05:10:09,617 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2023-12-16 05:10:09,617 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2023-12-16 05:10:09,617 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2023-12-16 05:10:09,617 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-12-16 05:10:09,617 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-12-16 05:10:09,617 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2023-12-16 05:10:09,617 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2023-12-16 05:10:09,660 INFO  L241             CfgBuilder]: Building ICFG
[2023-12-16 05:10:09,661 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-12-16 05:10:09,802 INFO  L282             CfgBuilder]: Performing block encoding
[2023-12-16 05:10:09,816 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-12-16 05:10:09,816 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2023-12-16 05:10:09,817 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:10:09 BoogieIcfgContainer
[2023-12-16 05:10:09,817 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-12-16 05:10:09,818 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-12-16 05:10:09,818 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-12-16 05:10:09,820 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-12-16 05:10:09,820 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:10:09" (1/3) ...
[2023-12-16 05:10:09,821 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6953d983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:10:09, skipping insertion in model container
[2023-12-16 05:10:09,821 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:10:09" (2/3) ...
[2023-12-16 05:10:09,821 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6953d983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:10:09, skipping insertion in model container
[2023-12-16 05:10:09,821 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:10:09" (3/3) ...
[2023-12-16 05:10:09,822 INFO  L112   eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound2.c
[2023-12-16 05:10:09,833 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-12-16 05:10:09,834 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-12-16 05:10:09,861 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-12-16 05:10:09,865 INFO  L357      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, mHoare=true, 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;@4fa1270f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-12-16 05:10:09,865 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-12-16 05:10:09,868 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2023-12-16 05:10:09,872 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2023-12-16 05:10:09,872 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 05:10:09,873 INFO  L195           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 05:10:09,873 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 05:10:09,876 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 05:10:09,876 INFO  L85        PathProgramCache]: Analyzing trace with hash 760957734, now seen corresponding path program 1 times
[2023-12-16 05:10:09,882 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 05:10:09,882 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754208866]
[2023-12-16 05:10:09,882 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:09,882 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 05:10:09,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:09,977 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2023-12-16 05:10:09,979 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:09,983 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-12-16 05:10:09,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:09,989 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2023-12-16 05:10:09,990 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:09,993 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2023-12-16 05:10:09,993 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 05:10:09,993 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754208866]
[2023-12-16 05:10:09,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754208866] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-16 05:10:09,994 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-16 05:10:09,994 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-12-16 05:10:09,995 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211395188]
[2023-12-16 05:10:09,995 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-16 05:10:09,998 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-12-16 05:10:09,998 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 05:10:10,020 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-12-16 05:10:10,020 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-12-16 05:10:10,022 INFO  L87              Difference]: Start difference. First operand  has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand  has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2023-12-16 05:10:10,053 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 05:10:10,053 INFO  L93              Difference]: Finished difference Result 58 states and 99 transitions.
[2023-12-16 05:10:10,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-12-16 05:10:10,055 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23
[2023-12-16 05:10:10,055 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 05:10:10,059 INFO  L225             Difference]: With dead ends: 58
[2023-12-16 05:10:10,059 INFO  L226             Difference]: Without dead ends: 28
[2023-12-16 05:10:10,061 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-12-16 05:10:10,065 INFO  L413           NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-16 05:10:10,067 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-16 05:10:10,077 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2023-12-16 05:10:10,092 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2023-12-16 05:10:10,093 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2023-12-16 05:10:10,096 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions.
[2023-12-16 05:10:10,097 INFO  L78                 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 23
[2023-12-16 05:10:10,097 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 05:10:10,097 INFO  L495      AbstractCegarLoop]: Abstraction has 28 states and 38 transitions.
[2023-12-16 05:10:10,097 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2023-12-16 05:10:10,098 INFO  L276                IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions.
[2023-12-16 05:10:10,099 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2023-12-16 05:10:10,099 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 05:10:10,099 INFO  L195           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 05:10:10,099 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-12-16 05:10:10,100 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 05:10:10,102 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 05:10:10,103 INFO  L85        PathProgramCache]: Analyzing trace with hash -387749596, now seen corresponding path program 1 times
[2023-12-16 05:10:10,103 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 05:10:10,104 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77252800]
[2023-12-16 05:10:10,104 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:10,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 05:10:10,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:10,306 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2023-12-16 05:10:10,308 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:10,310 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-12-16 05:10:10,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:10,313 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2023-12-16 05:10:10,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:10,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2023-12-16 05:10:10,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 05:10:10,317 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77252800]
[2023-12-16 05:10:10,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77252800] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-16 05:10:10,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-16 05:10:10,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-12-16 05:10:10,317 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483896008]
[2023-12-16 05:10:10,317 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-16 05:10:10,318 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-12-16 05:10:10,318 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 05:10:10,319 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-12-16 05:10:10,319 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-12-16 05:10:10,319 INFO  L87              Difference]: Start difference. First operand 28 states and 38 transitions. Second operand  has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2023-12-16 05:10:10,386 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 05:10:10,386 INFO  L93              Difference]: Finished difference Result 41 states and 55 transitions.
[2023-12-16 05:10:10,388 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-12-16 05:10:10,388 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23
[2023-12-16 05:10:10,395 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 05:10:10,396 INFO  L225             Difference]: With dead ends: 41
[2023-12-16 05:10:10,396 INFO  L226             Difference]: Without dead ends: 39
[2023-12-16 05:10:10,396 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2023-12-16 05:10:10,397 INFO  L413           NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-16 05:10:10,398 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 118 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-16 05:10:10,398 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2023-12-16 05:10:10,403 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32.
[2023-12-16 05:10:10,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2023-12-16 05:10:10,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions.
[2023-12-16 05:10:10,404 INFO  L78                 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23
[2023-12-16 05:10:10,404 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 05:10:10,405 INFO  L495      AbstractCegarLoop]: Abstraction has 32 states and 41 transitions.
[2023-12-16 05:10:10,405 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2023-12-16 05:10:10,405 INFO  L276                IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions.
[2023-12-16 05:10:10,405 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2023-12-16 05:10:10,405 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 05:10:10,405 INFO  L195           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 05:10:10,406 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-12-16 05:10:10,406 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 05:10:10,406 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 05:10:10,406 INFO  L85        PathProgramCache]: Analyzing trace with hash -1391236353, now seen corresponding path program 1 times
[2023-12-16 05:10:10,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 05:10:10,406 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853205209]
[2023-12-16 05:10:10,407 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:10,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 05:10:10,425 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:10,494 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2023-12-16 05:10:10,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:10,500 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-12-16 05:10:10,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:10,505 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2023-12-16 05:10:10,506 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:10,508 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2023-12-16 05:10:10,509 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:10,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2023-12-16 05:10:10,525 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 05:10:10,525 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853205209]
[2023-12-16 05:10:10,525 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853205209] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-16 05:10:10,525 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-16 05:10:10,525 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-12-16 05:10:10,525 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083717010]
[2023-12-16 05:10:10,526 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-16 05:10:10,526 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-12-16 05:10:10,526 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 05:10:10,526 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-12-16 05:10:10,527 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-12-16 05:10:10,527 INFO  L87              Difference]: Start difference. First operand 32 states and 41 transitions. Second operand  has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2023-12-16 05:10:10,593 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 05:10:10,593 INFO  L93              Difference]: Finished difference Result 45 states and 58 transitions.
[2023-12-16 05:10:10,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-12-16 05:10:10,594 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28
[2023-12-16 05:10:10,594 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 05:10:10,594 INFO  L225             Difference]: With dead ends: 45
[2023-12-16 05:10:10,594 INFO  L226             Difference]: Without dead ends: 43
[2023-12-16 05:10:10,595 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2023-12-16 05:10:10,596 INFO  L413           NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-16 05:10:10,596 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 114 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-16 05:10:10,596 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2023-12-16 05:10:10,604 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36.
[2023-12-16 05:10:10,604 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2023-12-16 05:10:10,605 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions.
[2023-12-16 05:10:10,605 INFO  L78                 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28
[2023-12-16 05:10:10,605 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 05:10:10,605 INFO  L495      AbstractCegarLoop]: Abstraction has 36 states and 44 transitions.
[2023-12-16 05:10:10,605 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2023-12-16 05:10:10,606 INFO  L276                IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions.
[2023-12-16 05:10:10,606 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2023-12-16 05:10:10,606 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 05:10:10,606 INFO  L195           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 05:10:10,606 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-12-16 05:10:10,607 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 05:10:10,607 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 05:10:10,607 INFO  L85        PathProgramCache]: Analyzing trace with hash 831418820, now seen corresponding path program 1 times
[2023-12-16 05:10:10,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 05:10:10,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850410587]
[2023-12-16 05:10:10,607 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:10,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 05:10:10,619 ERROR L246   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-12-16 05:10:10,620 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184792662]
[2023-12-16 05:10:10,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:10,620 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:10,620 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 05:10:10,638 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)
[2023-12-16 05:10:10,658 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-12-16 05:10:10,696 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:10,697 INFO  L262         TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 29 conjunts are in the unsatisfiable core
[2023-12-16 05:10:10,701 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-16 05:10:10,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-12-16 05:10:10,882 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-16 05:10:10,992 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2023-12-16 05:10:10,992 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 05:10:10,992 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850410587]
[2023-12-16 05:10:10,992 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-12-16 05:10:10,993 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184792662]
[2023-12-16 05:10:10,995 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [184792662] provided 0 perfect and 2 imperfect interpolant sequences
[2023-12-16 05:10:10,995 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-12-16 05:10:10,995 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16
[2023-12-16 05:10:10,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384051496]
[2023-12-16 05:10:10,996 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-12-16 05:10:10,997 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-12-16 05:10:10,997 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 05:10:10,998 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-12-16 05:10:10,998 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240
[2023-12-16 05:10:10,999 INFO  L87              Difference]: Start difference. First operand 36 states and 44 transitions. Second operand  has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9)
[2023-12-16 05:10:11,170 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 05:10:11,170 INFO  L93              Difference]: Finished difference Result 71 states and 92 transitions.
[2023-12-16 05:10:11,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2023-12-16 05:10:11,170 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 33
[2023-12-16 05:10:11,171 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 05:10:11,172 INFO  L225             Difference]: With dead ends: 71
[2023-12-16 05:10:11,172 INFO  L226             Difference]: Without dead ends: 56
[2023-12-16 05:10:11,173 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380
[2023-12-16 05:10:11,173 INFO  L413           NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-16 05:10:11,174 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 138 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-16 05:10:11,174 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2023-12-16 05:10:11,183 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55.
[2023-12-16 05:10:11,183 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 55 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15)
[2023-12-16 05:10:11,184 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions.
[2023-12-16 05:10:11,184 INFO  L78                 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 33
[2023-12-16 05:10:11,184 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 05:10:11,185 INFO  L495      AbstractCegarLoop]: Abstraction has 55 states and 68 transitions.
[2023-12-16 05:10:11,185 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9)
[2023-12-16 05:10:11,185 INFO  L276                IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions.
[2023-12-16 05:10:11,185 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2023-12-16 05:10:11,185 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 05:10:11,186 INFO  L195           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 05:10:11,204 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-12-16 05:10:11,390 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:11,391 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 05:10:11,391 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 05:10:11,391 INFO  L85        PathProgramCache]: Analyzing trace with hash -1016562388, now seen corresponding path program 1 times
[2023-12-16 05:10:11,391 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 05:10:11,391 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072928858]
[2023-12-16 05:10:11,391 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:11,392 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 05:10:11,398 ERROR L246   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-12-16 05:10:11,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1219115710]
[2023-12-16 05:10:11,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:11,399 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:11,399 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 05:10:11,403 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-12-16 05:10:11,407 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-12-16 05:10:11,437 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:11,438 INFO  L262         TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-12-16 05:10:11,441 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-16 05:10:11,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2023-12-16 05:10:11,625 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-16 05:10:11,626 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 05:10:11,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072928858]
[2023-12-16 05:10:11,627 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-12-16 05:10:11,627 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219115710]
[2023-12-16 05:10:11,627 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219115710] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-16 05:10:11,627 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-16 05:10:11,628 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2023-12-16 05:10:11,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699396871]
[2023-12-16 05:10:11,628 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-16 05:10:11,628 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-12-16 05:10:11,628 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 05:10:11,629 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-12-16 05:10:11,629 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2023-12-16 05:10:11,629 INFO  L87              Difference]: Start difference. First operand 55 states and 68 transitions. Second operand  has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)
[2023-12-16 05:10:11,752 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 05:10:11,752 INFO  L93              Difference]: Finished difference Result 66 states and 77 transitions.
[2023-12-16 05:10:11,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-12-16 05:10:11,753 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40
[2023-12-16 05:10:11,754 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 05:10:11,756 INFO  L225             Difference]: With dead ends: 66
[2023-12-16 05:10:11,758 INFO  L226             Difference]: Without dead ends: 55
[2023-12-16 05:10:11,758 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156
[2023-12-16 05:10:11,759 INFO  L413           NwaCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-16 05:10:11,759 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 120 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-16 05:10:11,760 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2023-12-16 05:10:11,768 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55.
[2023-12-16 05:10:11,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 55 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13)
[2023-12-16 05:10:11,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions.
[2023-12-16 05:10:11,769 INFO  L78                 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 40
[2023-12-16 05:10:11,769 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 05:10:11,770 INFO  L495      AbstractCegarLoop]: Abstraction has 55 states and 64 transitions.
[2023-12-16 05:10:11,770 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)
[2023-12-16 05:10:11,770 INFO  L276                IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions.
[2023-12-16 05:10:11,770 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2023-12-16 05:10:11,771 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 05:10:11,771 INFO  L195           NwaCegarLoop]: trace histogram [7, 6, 6, 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]
[2023-12-16 05:10:11,780 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-12-16 05:10:11,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:11,976 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 05:10:11,976 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 05:10:11,976 INFO  L85        PathProgramCache]: Analyzing trace with hash 2057146835, now seen corresponding path program 1 times
[2023-12-16 05:10:11,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 05:10:11,976 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991155979]
[2023-12-16 05:10:11,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:11,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 05:10:11,983 ERROR L246   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-12-16 05:10:11,984 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467358019]
[2023-12-16 05:10:11,984 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:11,984 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:11,984 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 05:10:11,985 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-12-16 05:10:12,012 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-12-16 05:10:12,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:12,024 INFO  L262         TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-12-16 05:10:12,026 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-16 05:10:12,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2023-12-16 05:10:12,267 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-16 05:10:12,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2023-12-16 05:10:12,434 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 05:10:12,434 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991155979]
[2023-12-16 05:10:12,434 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-12-16 05:10:12,435 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467358019]
[2023-12-16 05:10:12,435 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [467358019] provided 0 perfect and 2 imperfect interpolant sequences
[2023-12-16 05:10:12,435 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-12-16 05:10:12,435 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16
[2023-12-16 05:10:12,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531945113]
[2023-12-16 05:10:12,435 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-12-16 05:10:12,437 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-12-16 05:10:12,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 05:10:12,438 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-12-16 05:10:12,438 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240
[2023-12-16 05:10:12,439 INFO  L87              Difference]: Start difference. First operand 55 states and 64 transitions. Second operand  has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 8 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17)
[2023-12-16 05:10:12,748 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 05:10:12,748 INFO  L93              Difference]: Finished difference Result 96 states and 120 transitions.
[2023-12-16 05:10:12,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2023-12-16 05:10:12,749 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 8 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) Word has length 57
[2023-12-16 05:10:12,750 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 05:10:12,752 INFO  L225             Difference]: With dead ends: 96
[2023-12-16 05:10:12,752 INFO  L226             Difference]: Without dead ends: 92
[2023-12-16 05:10:12,753 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462
[2023-12-16 05:10:12,754 INFO  L413           NwaCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2023-12-16 05:10:12,756 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 302 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2023-12-16 05:10:12,757 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2023-12-16 05:10:12,782 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85.
[2023-12-16 05:10:12,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 85 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 54 states have internal predecessors, (59), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22)
[2023-12-16 05:10:12,786 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions.
[2023-12-16 05:10:12,786 INFO  L78                 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 57
[2023-12-16 05:10:12,787 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 05:10:12,787 INFO  L495      AbstractCegarLoop]: Abstraction has 85 states and 104 transitions.
[2023-12-16 05:10:12,787 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 8 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17)
[2023-12-16 05:10:12,787 INFO  L276                IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions.
[2023-12-16 05:10:12,792 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2023-12-16 05:10:12,793 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 05:10:12,793 INFO  L195           NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 05:10:12,807 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-12-16 05:10:12,998 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:12,998 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 05:10:12,998 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 05:10:12,998 INFO  L85        PathProgramCache]: Analyzing trace with hash 1282123871, now seen corresponding path program 1 times
[2023-12-16 05:10:12,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 05:10:12,998 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677102678]
[2023-12-16 05:10:12,998 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:12,999 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 05:10:13,017 ERROR L246   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-12-16 05:10:13,018 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [436082921]
[2023-12-16 05:10:13,018 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:13,018 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:13,018 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 05:10:13,019 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-12-16 05:10:13,025 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-12-16 05:10:13,072 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:13,074 INFO  L262         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-12-16 05:10:13,076 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-16 05:10:13,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked.
[2023-12-16 05:10:13,406 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-16 05:10:14,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2023-12-16 05:10:14,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 05:10:14,447 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677102678]
[2023-12-16 05:10:14,447 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-12-16 05:10:14,447 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436082921]
[2023-12-16 05:10:14,447 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [436082921] provided 0 perfect and 2 imperfect interpolant sequences
[2023-12-16 05:10:14,447 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-12-16 05:10:14,447 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19
[2023-12-16 05:10:14,447 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081399489]
[2023-12-16 05:10:14,447 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-12-16 05:10:14,448 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2023-12-16 05:10:14,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 05:10:14,448 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2023-12-16 05:10:14,448 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342
[2023-12-16 05:10:14,449 INFO  L87              Difference]: Start difference. First operand 85 states and 104 transitions. Second operand  has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 9 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20)
[2023-12-16 05:10:21,696 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 05:10:21,697 INFO  L93              Difference]: Finished difference Result 148 states and 197 transitions.
[2023-12-16 05:10:21,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-12-16 05:10:21,697 INFO  L78                 Accepts]: Start accepts. Automaton has  has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 9 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) Word has length 70
[2023-12-16 05:10:21,698 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 05:10:21,699 INFO  L225             Difference]: With dead ends: 148
[2023-12-16 05:10:21,699 INFO  L226             Difference]: Without dead ends: 127
[2023-12-16 05:10:21,699 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812
[2023-12-16 05:10:21,700 INFO  L413           NwaCegarLoop]: 25 mSDtfsCounter, 79 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2023-12-16 05:10:21,700 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 287 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2023-12-16 05:10:21,700 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2023-12-16 05:10:21,718 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 99.
[2023-12-16 05:10:21,719 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26)
[2023-12-16 05:10:21,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions.
[2023-12-16 05:10:21,719 INFO  L78                 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 70
[2023-12-16 05:10:21,727 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 05:10:21,728 INFO  L495      AbstractCegarLoop]: Abstraction has 99 states and 124 transitions.
[2023-12-16 05:10:21,728 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 9 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20)
[2023-12-16 05:10:21,728 INFO  L276                IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions.
[2023-12-16 05:10:21,728 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2023-12-16 05:10:21,728 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 05:10:21,729 INFO  L195           NwaCegarLoop]: trace histogram [11, 10, 10, 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]
[2023-12-16 05:10:21,737 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2023-12-16 05:10:21,933 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:21,933 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 05:10:21,934 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 05:10:21,934 INFO  L85        PathProgramCache]: Analyzing trace with hash 1411586487, now seen corresponding path program 1 times
[2023-12-16 05:10:21,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 05:10:21,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442418396]
[2023-12-16 05:10:21,934 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:21,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 05:10:21,953 ERROR L246   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-12-16 05:10:21,953 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [989478642]
[2023-12-16 05:10:21,954 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:21,954 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:21,954 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 05:10:21,955 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-12-16 05:10:21,972 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-12-16 05:10:21,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:21,999 INFO  L262         TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core
[2023-12-16 05:10:22,001 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-16 05:10:22,190 INFO  L134       CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked.
[2023-12-16 05:10:22,190 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-16 05:10:22,330 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 05:10:22,330 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442418396]
[2023-12-16 05:10:22,330 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-12-16 05:10:22,330 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989478642]
[2023-12-16 05:10:22,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [989478642] provided 0 perfect and 1 imperfect interpolant sequences
[2023-12-16 05:10:22,330 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2023-12-16 05:10:22,330 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2023-12-16 05:10:22,330 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949836929]
[2023-12-16 05:10:22,330 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2023-12-16 05:10:22,330 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2023-12-16 05:10:22,330 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 05:10:22,331 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2023-12-16 05:10:22,331 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272
[2023-12-16 05:10:22,331 INFO  L87              Difference]: Start difference. First operand 99 states and 124 transitions. Second operand  has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13)
[2023-12-16 05:10:22,689 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 05:10:22,689 INFO  L93              Difference]: Finished difference Result 113 states and 141 transitions.
[2023-12-16 05:10:22,689 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2023-12-16 05:10:22,689 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 81
[2023-12-16 05:10:22,690 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 05:10:22,690 INFO  L225             Difference]: With dead ends: 113
[2023-12-16 05:10:22,690 INFO  L226             Difference]: Without dead ends: 104
[2023-12-16 05:10:22,691 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600
[2023-12-16 05:10:22,691 INFO  L413           NwaCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2023-12-16 05:10:22,691 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 328 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2023-12-16 05:10:22,691 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2023-12-16 05:10:22,711 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104.
[2023-12-16 05:10:22,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 104 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 65 states have internal predecessors, (72), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28)
[2023-12-16 05:10:22,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 129 transitions.
[2023-12-16 05:10:22,712 INFO  L78                 Accepts]: Start accepts. Automaton has 104 states and 129 transitions. Word has length 81
[2023-12-16 05:10:22,712 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 05:10:22,712 INFO  L495      AbstractCegarLoop]: Abstraction has 104 states and 129 transitions.
[2023-12-16 05:10:22,712 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13)
[2023-12-16 05:10:22,712 INFO  L276                IsEmpty]: Start isEmpty. Operand 104 states and 129 transitions.
[2023-12-16 05:10:22,713 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2023-12-16 05:10:22,713 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 05:10:22,713 INFO  L195           NwaCegarLoop]: trace histogram [11, 10, 10, 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]
[2023-12-16 05:10:22,732 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-12-16 05:10:22,917 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:22,917 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 05:10:22,918 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 05:10:22,918 INFO  L85        PathProgramCache]: Analyzing trace with hash -302279341, now seen corresponding path program 2 times
[2023-12-16 05:10:22,918 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 05:10:22,918 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598278073]
[2023-12-16 05:10:22,918 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:22,919 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 05:10:22,932 ERROR L246   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-12-16 05:10:22,932 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344429796]
[2023-12-16 05:10:22,932 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-12-16 05:10:22,932 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:22,932 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 05:10:22,935 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-12-16 05:10:22,939 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-12-16 05:10:22,979 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-12-16 05:10:22,980 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-12-16 05:10:22,980 INFO  L262         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core
[2023-12-16 05:10:22,987 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-16 05:10:23,010 INFO  L134       CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked.
[2023-12-16 05:10:23,010 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-16 05:10:23,070 INFO  L134       CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked.
[2023-12-16 05:10:23,070 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 05:10:23,070 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598278073]
[2023-12-16 05:10:23,070 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-12-16 05:10:23,070 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344429796]
[2023-12-16 05:10:23,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [344429796] provided 0 perfect and 2 imperfect interpolant sequences
[2023-12-16 05:10:23,070 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-12-16 05:10:23,070 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5
[2023-12-16 05:10:23,070 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989302139]
[2023-12-16 05:10:23,070 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-12-16 05:10:23,072 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-12-16 05:10:23,072 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 05:10:23,073 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-12-16 05:10:23,073 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-12-16 05:10:23,073 INFO  L87              Difference]: Start difference. First operand 104 states and 129 transitions. Second operand  has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)
[2023-12-16 05:10:23,147 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 05:10:23,147 INFO  L93              Difference]: Finished difference Result 129 states and 162 transitions.
[2023-12-16 05:10:23,147 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-12-16 05:10:23,147 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 83
[2023-12-16 05:10:23,148 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 05:10:23,148 INFO  L225             Difference]: With dead ends: 129
[2023-12-16 05:10:23,148 INFO  L226             Difference]: Without dead ends: 99
[2023-12-16 05:10:23,149 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-12-16 05:10:23,151 INFO  L413           NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-16 05:10:23,151 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-16 05:10:23,151 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2023-12-16 05:10:23,179 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99.
[2023-12-16 05:10:23,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 62 states have internal predecessors, (68), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26)
[2023-12-16 05:10:23,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions.
[2023-12-16 05:10:23,179 INFO  L78                 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 83
[2023-12-16 05:10:23,180 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 05:10:23,180 INFO  L495      AbstractCegarLoop]: Abstraction has 99 states and 121 transitions.
[2023-12-16 05:10:23,180 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)
[2023-12-16 05:10:23,180 INFO  L276                IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions.
[2023-12-16 05:10:23,184 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2023-12-16 05:10:23,184 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 05:10:23,184 INFO  L195           NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 05:10:23,197 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2023-12-16 05:10:23,389 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:23,389 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 05:10:23,389 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 05:10:23,389 INFO  L85        PathProgramCache]: Analyzing trace with hash 1209712204, now seen corresponding path program 3 times
[2023-12-16 05:10:23,389 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 05:10:23,390 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612260499]
[2023-12-16 05:10:23,390 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:23,390 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 05:10:23,407 ERROR L246   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-12-16 05:10:23,407 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911076009]
[2023-12-16 05:10:23,407 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-12-16 05:10:23,407 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:23,407 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 05:10:23,408 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-12-16 05:10:23,438 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-12-16 05:10:23,455 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2023-12-16 05:10:23,455 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-12-16 05:10:23,456 INFO  L262         TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjunts are in the unsatisfiable core
[2023-12-16 05:10:23,457 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-16 05:10:23,788 INFO  L134       CoverageAnalysis]: Checked inductivity of 374 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked.
[2023-12-16 05:10:23,789 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-16 05:10:24,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 374 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked.
[2023-12-16 05:10:24,300 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 05:10:24,300 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612260499]
[2023-12-16 05:10:24,300 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-12-16 05:10:24,300 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911076009]
[2023-12-16 05:10:24,300 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911076009] provided 0 perfect and 2 imperfect interpolant sequences
[2023-12-16 05:10:24,300 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-12-16 05:10:24,300 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18
[2023-12-16 05:10:24,300 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385970014]
[2023-12-16 05:10:24,300 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-12-16 05:10:24,300 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2023-12-16 05:10:24,301 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 05:10:24,301 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2023-12-16 05:10:24,301 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306
[2023-12-16 05:10:24,301 INFO  L87              Difference]: Start difference. First operand 99 states and 121 transitions. Second operand  has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 11 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30)
[2023-12-16 05:10:24,881 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 05:10:24,881 INFO  L93              Difference]: Finished difference Result 183 states and 235 transitions.
[2023-12-16 05:10:24,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2023-12-16 05:10:24,882 INFO  L78                 Accepts]: Start accepts. Automaton has  has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 11 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) Word has length 100
[2023-12-16 05:10:24,882 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 05:10:24,883 INFO  L225             Difference]: With dead ends: 183
[2023-12-16 05:10:24,883 INFO  L226             Difference]: Without dead ends: 120
[2023-12-16 05:10:24,884 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702
[2023-12-16 05:10:24,884 INFO  L413           NwaCegarLoop]: 49 mSDtfsCounter, 63 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2023-12-16 05:10:24,885 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 492 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2023-12-16 05:10:24,885 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2023-12-16 05:10:24,923 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100.
[2023-12-16 05:10:24,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 63 states have internal predecessors, (68), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26)
[2023-12-16 05:10:24,924 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions.
[2023-12-16 05:10:24,924 INFO  L78                 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 100
[2023-12-16 05:10:24,924 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 05:10:24,924 INFO  L495      AbstractCegarLoop]: Abstraction has 100 states and 121 transitions.
[2023-12-16 05:10:24,924 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 11 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30)
[2023-12-16 05:10:24,924 INFO  L276                IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions.
[2023-12-16 05:10:24,925 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2023-12-16 05:10:24,925 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 05:10:24,925 INFO  L195           NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 05:10:24,945 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2023-12-16 05:10:25,134 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:25,134 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 05:10:25,135 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 05:10:25,135 INFO  L85        PathProgramCache]: Analyzing trace with hash -479231538, now seen corresponding path program 1 times
[2023-12-16 05:10:25,135 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 05:10:25,135 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895872770]
[2023-12-16 05:10:25,135 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:25,135 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 05:10:25,141 ERROR L246   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-12-16 05:10:25,141 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [540146648]
[2023-12-16 05:10:25,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:25,141 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:25,141 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 05:10:25,142 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-12-16 05:10:25,170 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-12-16 05:10:25,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:25,201 INFO  L262         TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-12-16 05:10:25,202 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-16 05:10:25,249 INFO  L134       CoverageAnalysis]: Checked inductivity of 374 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked.
[2023-12-16 05:10:25,249 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-16 05:10:25,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 05:10:25,249 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895872770]
[2023-12-16 05:10:25,249 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-12-16 05:10:25,249 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540146648]
[2023-12-16 05:10:25,249 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [540146648] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-16 05:10:25,249 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-16 05:10:25,249 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-12-16 05:10:25,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706050630]
[2023-12-16 05:10:25,250 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-16 05:10:25,250 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-12-16 05:10:25,250 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 05:10:25,250 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-12-16 05:10:25,250 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-12-16 05:10:25,251 INFO  L87              Difference]: Start difference. First operand 100 states and 121 transitions. Second operand  has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13)
[2023-12-16 05:10:25,280 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 05:10:25,280 INFO  L93              Difference]: Finished difference Result 120 states and 142 transitions.
[2023-12-16 05:10:25,280 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-12-16 05:10:25,281 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 100
[2023-12-16 05:10:25,281 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 05:10:25,281 INFO  L225             Difference]: With dead ends: 120
[2023-12-16 05:10:25,281 INFO  L226             Difference]: Without dead ends: 88
[2023-12-16 05:10:25,282 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-12-16 05:10:25,282 INFO  L413           NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-16 05:10:25,282 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-16 05:10:25,283 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2023-12-16 05:10:25,295 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88.
[2023-12-16 05:10:25,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 88 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 states have internal predecessors, (60), 21 states have call successors, (21), 11 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2023-12-16 05:10:25,296 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions.
[2023-12-16 05:10:25,296 INFO  L78                 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 100
[2023-12-16 05:10:25,296 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 05:10:25,296 INFO  L495      AbstractCegarLoop]: Abstraction has 88 states and 101 transitions.
[2023-12-16 05:10:25,296 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13)
[2023-12-16 05:10:25,296 INFO  L276                IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions.
[2023-12-16 05:10:25,297 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2023-12-16 05:10:25,297 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 05:10:25,297 INFO  L195           NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 05:10:25,306 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2023-12-16 05:10:25,502 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2023-12-16 05:10:25,502 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 05:10:25,502 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 05:10:25,502 INFO  L85        PathProgramCache]: Analyzing trace with hash -1299465319, now seen corresponding path program 2 times
[2023-12-16 05:10:25,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 05:10:25,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695478830]
[2023-12-16 05:10:25,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:25,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 05:10:25,508 ERROR L246   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-12-16 05:10:25,508 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1813630361]
[2023-12-16 05:10:25,508 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-12-16 05:10:25,508 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:25,508 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 05:10:25,509 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-12-16 05:10:25,537 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-12-16 05:10:25,558 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-12-16 05:10:25,558 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-12-16 05:10:25,559 INFO  L262         TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 42 conjunts are in the unsatisfiable core
[2023-12-16 05:10:25,561 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-16 05:10:25,939 INFO  L134       CoverageAnalysis]: Checked inductivity of 430 backedges. 30 proven. 69 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked.
[2023-12-16 05:10:25,940 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-16 05:10:54,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 430 backedges. 30 proven. 63 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked.
[2023-12-16 05:10:54,992 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 05:10:54,992 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695478830]
[2023-12-16 05:10:54,992 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-12-16 05:10:54,992 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813630361]
[2023-12-16 05:10:54,992 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813630361] provided 0 perfect and 2 imperfect interpolant sequences
[2023-12-16 05:10:54,992 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-12-16 05:10:54,992 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29
[2023-12-16 05:10:54,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314559548]
[2023-12-16 05:10:54,992 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-12-16 05:10:54,993 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-12-16 05:10:54,993 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 05:10:54,993 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-12-16 05:10:54,994 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812
[2023-12-16 05:10:54,994 INFO  L87              Difference]: Start difference. First operand 88 states and 101 transitions. Second operand  has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 26 states have internal predecessors, (50), 16 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 16 states have call predecessors, (34), 16 states have call successors, (34)
[2023-12-16 05:10:55,726 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 05:10:55,726 INFO  L93              Difference]: Finished difference Result 111 states and 124 transitions.
[2023-12-16 05:10:55,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-12-16 05:10:55,727 INFO  L78                 Accepts]: Start accepts. Automaton has  has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 26 states have internal predecessors, (50), 16 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 16 states have call predecessors, (34), 16 states have call successors, (34) Word has length 105
[2023-12-16 05:10:55,727 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 05:10:55,727 INFO  L225             Difference]: With dead ends: 111
[2023-12-16 05:10:55,727 INFO  L226             Difference]: Without dead ends: 88
[2023-12-16 05:10:55,728 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406
[2023-12-16 05:10:55,728 INFO  L413           NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2023-12-16 05:10:55,728 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 417 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2023-12-16 05:10:55,729 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2023-12-16 05:10:55,740 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88.
[2023-12-16 05:10:55,740 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 88 states, 56 states have (on average 1.0) internal successors, (56), 56 states have internal predecessors, (56), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2023-12-16 05:10:55,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions.
[2023-12-16 05:10:55,741 INFO  L78                 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 105
[2023-12-16 05:10:55,741 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 05:10:55,741 INFO  L495      AbstractCegarLoop]: Abstraction has 88 states and 93 transitions.
[2023-12-16 05:10:55,741 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 26 states have internal predecessors, (50), 16 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 16 states have call predecessors, (34), 16 states have call successors, (34)
[2023-12-16 05:10:55,741 INFO  L276                IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions.
[2023-12-16 05:10:55,742 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2023-12-16 05:10:55,742 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 05:10:55,742 INFO  L195           NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 05:10:55,750 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2023-12-16 05:10:55,947 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:55,947 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 05:10:55,948 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 05:10:55,948 INFO  L85        PathProgramCache]: Analyzing trace with hash -663832148, now seen corresponding path program 1 times
[2023-12-16 05:10:55,948 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 05:10:55,948 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324586762]
[2023-12-16 05:10:55,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:55,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 05:10:55,958 ERROR L246   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-12-16 05:10:55,958 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [130870686]
[2023-12-16 05:10:55,958 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 05:10:55,958 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 05:10:55,959 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 05:10:55,962 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-12-16 05:10:55,964 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-12-16 05:10:56,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 05:10:56,038 INFO  L262         TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 49 conjunts are in the unsatisfiable core
[2023-12-16 05:10:56,056 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-16 05:10:56,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 490 backedges. 29 proven. 77 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked.
[2023-12-16 05:10:56,998 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-16 05:11:13,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 490 backedges. 29 proven. 71 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked.
[2023-12-16 05:11:13,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 05:11:13,151 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324586762]
[2023-12-16 05:11:13,151 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-12-16 05:11:13,151 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130870686]
[2023-12-16 05:11:13,151 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [130870686] provided 0 perfect and 2 imperfect interpolant sequences
[2023-12-16 05:11:13,151 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-12-16 05:11:13,151 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29
[2023-12-16 05:11:13,151 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924572205]
[2023-12-16 05:11:13,151 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-12-16 05:11:13,151 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-12-16 05:11:13,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 05:11:13,152 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-12-16 05:11:13,152 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812
[2023-12-16 05:11:13,152 INFO  L87              Difference]: Start difference. First operand 88 states and 93 transitions. Second operand  has 29 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 17 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (36), 14 states have call predecessors, (36), 15 states have call successors, (36)
[2023-12-16 05:11:14,504 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 05:11:14,504 INFO  L93              Difference]: Finished difference Result 88 states and 93 transitions.
[2023-12-16 05:11:14,505 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-12-16 05:11:14,505 INFO  L78                 Accepts]: Start accepts. Automaton has  has 29 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 17 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (36), 14 states have call predecessors, (36), 15 states have call successors, (36) Word has length 111
[2023-12-16 05:11:14,505 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 05:11:14,505 INFO  L225             Difference]: With dead ends: 88
[2023-12-16 05:11:14,505 INFO  L226             Difference]: Without dead ends: 0
[2023-12-16 05:11:14,506 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992
[2023-12-16 05:11:14,506 INFO  L413           NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2023-12-16 05:11:14,506 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 347 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2023-12-16 05:11:14,507 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2023-12-16 05:11:14,507 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2023-12-16 05:11:14,507 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)
[2023-12-16 05:11:14,507 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2023-12-16 05:11:14,507 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111
[2023-12-16 05:11:14,507 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 05:11:14,507 INFO  L495      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2023-12-16 05:11:14,507 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 17 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (36), 14 states have call predecessors, (36), 15 states have call successors, (36)
[2023-12-16 05:11:14,507 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2023-12-16 05:11:14,507 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2023-12-16 05:11:14,509 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-12-16 05:11:14,514 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2023-12-16 05:11:14,714 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2023-12-16 05:11:14,715 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2023-12-16 05:11:16,219 INFO  L895   garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse0) (<= 1 .cse0) (<= .cse0 2)))
[2023-12-16 05:11:16,219 INFO  L899   garLoopResultBuilder]: For program point L48(lines 46 58) no Hoare annotation was computed.
[2023-12-16 05:11:16,219 INFO  L895   garLoopResultBuilder]: At program point L36-2(lines 36 44) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse7 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse5 (<= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~r~0#1|))) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (<= 1 |ULTIMATE.start_main_~d~0#1|)) (.cse4 (= |ULTIMATE.start_main_~r~0#1| .cse7)) (.cse6 (* 2 .cse0))) (or (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 .cse3 (<= .cse0 2) .cse4) (and .cse5 (= 2 |ULTIMATE.start_main_~p~0#1|) (= .cse6 |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_main_~p~0#1| 4) .cse5 .cse1 .cse2 .cse3 .cse4 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (= (+ (div |ULTIMATE.start_main_~d~0#1| 2) .cse7) (+ .cse6 |ULTIMATE.start_main_~r~0#1|))))))
[2023-12-16 05:11:16,219 INFO  L899   garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed.
[2023-12-16 05:11:16,219 INFO  L895   garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 2)
[2023-12-16 05:11:16,219 INFO  L895   garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (and (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 2) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 2))
[2023-12-16 05:11:16,220 INFO  L895   garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse7 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse5 (<= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~r~0#1|))) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (<= 1 |ULTIMATE.start_main_~d~0#1|)) (.cse4 (= |ULTIMATE.start_main_~r~0#1| .cse7)) (.cse6 (* 2 .cse0))) (or (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 .cse3 (<= .cse0 2) .cse4) (and .cse5 (= 2 |ULTIMATE.start_main_~p~0#1|) (= .cse6 |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_main_~p~0#1| 4) .cse5 .cse1 .cse2 .cse3 .cse4 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (= (+ (div |ULTIMATE.start_main_~d~0#1| 2) .cse7) (+ .cse6 |ULTIMATE.start_main_~r~0#1|))))))
[2023-12-16 05:11:16,220 INFO  L895   garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse7 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse5 (<= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~r~0#1|))) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (<= 1 |ULTIMATE.start_main_~d~0#1|)) (.cse4 (= |ULTIMATE.start_main_~r~0#1| .cse7)) (.cse6 (* 2 .cse0))) (or (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 .cse3 (<= .cse0 2) .cse4) (and .cse5 (= 2 |ULTIMATE.start_main_~p~0#1|) (= .cse6 |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_main_~p~0#1| 4) .cse5 .cse1 .cse2 .cse3 .cse4 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (= (+ (div |ULTIMATE.start_main_~d~0#1| 2) .cse7) (+ .cse6 |ULTIMATE.start_main_~r~0#1|))))))
[2023-12-16 05:11:16,220 INFO  L899   garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2023-12-16 05:11:16,220 INFO  L899   garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed.
[2023-12-16 05:11:16,220 INFO  L899   garLoopResultBuilder]: For program point L54(lines 54 57) no Hoare annotation was computed.
[2023-12-16 05:11:16,220 INFO  L895   garLoopResultBuilder]: At program point L54-2(lines 46 58) the Hoare annotation is: (let ((.cse1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse5 (+ |ULTIMATE.start_main_~r~0#1| 1)) (.cse16 (* 2 .cse1)) (.cse13 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse6 (= .cse1 1)) (.cse7 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse8 (= 2 |ULTIMATE.start_main_~q~0#1|)) (.cse9 (= 2 .cse13)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse14 (+ .cse16 |ULTIMATE.start_main_~r~0#1|)) (.cse11 (<= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~r~0#1|))) (.cse10 (= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (<= .cse1 2)) (.cse4 (= |ULTIMATE.start_main_~r~0#1| .cse13)) (.cse12 (<= .cse5 |ULTIMATE.start_main_~d~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse1) .cse2 .cse3 .cse4 (<= .cse5 .cse1)) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse6 .cse7 .cse8 .cse9 (= 2 |ULTIMATE.start_main_~d~0#1|)) (and (= |ULTIMATE.start_main_~p~0#1| 4) .cse11 (<= |ULTIMATE.start_main_~r~0#1| 2) .cse2 .cse4 .cse12 (= (+ (div |ULTIMATE.start_main_~d~0#1| 2) .cse13) .cse14)) (let ((.cse15 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|))) (and .cse0 (<= 1 .cse1) (= |ULTIMATE.start_main_~q~0#1| 1) .cse3 (<= 1 .cse15) (= .cse15 .cse13) (= (+ |ULTIMATE.start_main_~d~0#1| .cse13) .cse14))) (and .cse11 .cse10 (= .cse16 |ULTIMATE.start_main_~d~0#1|) .cse2 .cse3 .cse4 .cse12)))))
[2023-12-16 05:11:16,220 INFO  L895   garLoopResultBuilder]: At program point L46-1(lines 46 58) the Hoare annotation is: (let ((.cse5 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse1 (= |ULTIMATE.start_main_~d~0#1| .cse5)) (.cse2 (<= 1 .cse5)) (.cse3 (<= .cse5 2)) (.cse4 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~q~0#1| 0) .cse3 (= |ULTIMATE.start_main_~r~0#1| .cse4)) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 (<= .cse4 2) (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0) (<= (+ (* 2 |ULTIMATE.start_main_~r~0#1|) 1) .cse4) (<= 0 |ULTIMATE.start_main_~r~0#1|) (= .cse5 1) (= 2 |ULTIMATE.start_main_~q~0#1|)) (let ((.cse6 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|))) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~q~0#1| 1) .cse3 (<= 1 .cse6) (= .cse6 .cse4))))))
[2023-12-16 05:11:16,220 INFO  L899   garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed.
[2023-12-16 05:11:16,220 INFO  L895   garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse7 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse5 (<= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~r~0#1|))) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| 2)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (<= 1 |ULTIMATE.start_main_~d~0#1|)) (.cse4 (= |ULTIMATE.start_main_~r~0#1| .cse7)) (.cse6 (* 2 .cse0))) (or (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 .cse3 (<= .cse0 2) .cse4) (and .cse5 (= 2 |ULTIMATE.start_main_~p~0#1|) (= .cse6 |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_main_~p~0#1| 4) .cse5 .cse1 .cse2 .cse3 .cse4 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (= (+ (div |ULTIMATE.start_main_~d~0#1| 2) .cse7) (+ .cse6 |ULTIMATE.start_main_~r~0#1|))))))
[2023-12-16 05:11:16,220 INFO  L902   garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true
[2023-12-16 05:11:16,220 INFO  L899   garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed.
[2023-12-16 05:11:16,221 INFO  L895   garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse5 (+ |ULTIMATE.start_main_~r~0#1| 1)) (.cse16 (* 2 .cse1)) (.cse13 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse6 (= .cse1 1)) (.cse7 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse8 (= 2 |ULTIMATE.start_main_~q~0#1|)) (.cse9 (= 2 .cse13)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse14 (+ .cse16 |ULTIMATE.start_main_~r~0#1|)) (.cse11 (<= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~r~0#1|))) (.cse10 (= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (<= .cse1 2)) (.cse4 (= |ULTIMATE.start_main_~r~0#1| .cse13)) (.cse12 (<= .cse5 |ULTIMATE.start_main_~d~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse1) .cse2 .cse3 .cse4 (<= .cse5 .cse1)) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse6 .cse7 .cse8 .cse9 (= 2 |ULTIMATE.start_main_~d~0#1|)) (and (= |ULTIMATE.start_main_~p~0#1| 4) .cse11 (<= |ULTIMATE.start_main_~r~0#1| 2) .cse2 .cse4 .cse12 (= (+ (div |ULTIMATE.start_main_~d~0#1| 2) .cse13) .cse14)) (let ((.cse15 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|))) (and .cse0 (<= 1 .cse1) (= |ULTIMATE.start_main_~q~0#1| 1) .cse3 (<= 1 .cse15) (= .cse15 .cse13) (= (+ |ULTIMATE.start_main_~d~0#1| .cse13) .cse14))) (and .cse11 .cse10 (= .cse16 |ULTIMATE.start_main_~d~0#1|) .cse2 .cse3 .cse4 .cse12)))))
[2023-12-16 05:11:16,221 INFO  L895   garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse5 (+ |ULTIMATE.start_main_~r~0#1| 1)) (.cse16 (* 2 .cse1)) (.cse13 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse6 (= .cse1 1)) (.cse7 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse8 (= 2 |ULTIMATE.start_main_~q~0#1|)) (.cse9 (= 2 .cse13)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse14 (+ .cse16 |ULTIMATE.start_main_~r~0#1|)) (.cse11 (<= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~r~0#1|))) (.cse10 (= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (<= .cse1 2)) (.cse4 (= |ULTIMATE.start_main_~r~0#1| .cse13)) (.cse12 (<= .cse5 |ULTIMATE.start_main_~d~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse1) .cse2 .cse3 .cse4 (<= .cse5 .cse1)) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse6 .cse7 .cse8 .cse9 (= 2 |ULTIMATE.start_main_~d~0#1|)) (and (= |ULTIMATE.start_main_~p~0#1| 4) .cse11 (<= |ULTIMATE.start_main_~r~0#1| 2) .cse2 .cse4 .cse12 (= (+ (div |ULTIMATE.start_main_~d~0#1| 2) .cse13) .cse14)) (let ((.cse15 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|))) (and .cse0 (<= 1 .cse1) (= |ULTIMATE.start_main_~q~0#1| 1) .cse3 (<= 1 .cse15) (= .cse15 .cse13) (= (+ |ULTIMATE.start_main_~d~0#1| .cse13) .cse14))) (and .cse11 .cse10 (= .cse16 |ULTIMATE.start_main_~d~0#1|) .cse2 .cse3 .cse4 .cse12)))))
[2023-12-16 05:11:16,221 INFO  L899   garLoopResultBuilder]: For program point L39(lines 36 44) no Hoare annotation was computed.
[2023-12-16 05:11:16,221 INFO  L899   garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed.
[2023-12-16 05:11:16,221 INFO  L899   garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed.
[2023-12-16 05:11:16,221 INFO  L902   garLoopResultBuilder]: At program point $Ultimate##0(lines 11 13) the Hoare annotation is: true
[2023-12-16 05:11:16,221 INFO  L899   garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed.
[2023-12-16 05:11:16,221 INFO  L899   garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed.
[2023-12-16 05:11:16,221 INFO  L899   garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed.
[2023-12-16 05:11:16,221 INFO  L899   garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed.
[2023-12-16 05:11:16,221 INFO  L899   garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed.
[2023-12-16 05:11:16,221 INFO  L902   garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true
[2023-12-16 05:11:16,221 INFO  L899   garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed.
[2023-12-16 05:11:16,223 INFO  L445         BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 05:11:16,224 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2023-12-16 05:11:16,233 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:11:16 BoogieIcfgContainer
[2023-12-16 05:11:16,233 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-12-16 05:11:16,234 INFO  L158              Benchmark]: Toolchain (without parser) took 66884.74ms. Allocated memory was 244.3MB in the beginning and 293.6MB in the end (delta: 49.3MB). Free memory was 196.4MB in the beginning and 215.4MB in the end (delta: -19.0MB). Peak memory consumption was 165.7MB. Max. memory is 8.0GB.
[2023-12-16 05:11:16,234 INFO  L158              Benchmark]: CDTParser took 0.10ms. Allocated memory is still 201.3MB. Free memory was 149.4MB in the beginning and 149.2MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB.
[2023-12-16 05:11:16,234 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 160.00ms. Allocated memory is still 244.3MB. Free memory was 196.4MB in the beginning and 185.0MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
[2023-12-16 05:11:16,234 INFO  L158              Benchmark]: Boogie Procedure Inliner took 19.72ms. Allocated memory is still 244.3MB. Free memory was 185.0MB in the beginning and 183.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2023-12-16 05:11:16,234 INFO  L158              Benchmark]: Boogie Preprocessor took 20.34ms. Allocated memory is still 244.3MB. Free memory was 183.4MB in the beginning and 181.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2023-12-16 05:11:16,234 INFO  L158              Benchmark]: RCFGBuilder took 263.78ms. Allocated memory is still 244.3MB. Free memory was 181.3MB in the beginning and 169.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2023-12-16 05:11:16,235 INFO  L158              Benchmark]: TraceAbstraction took 66415.10ms. Allocated memory was 244.3MB in the beginning and 293.6MB in the end (delta: 49.3MB). Free memory was 168.7MB in the beginning and 215.4MB in the end (delta: -46.6MB). Peak memory consumption was 138.5MB. Max. memory is 8.0GB.
[2023-12-16 05:11:16,235 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.10ms. Allocated memory is still 201.3MB. Free memory was 149.4MB in the beginning and 149.2MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 160.00ms. Allocated memory is still 244.3MB. Free memory was 196.4MB in the beginning and 185.0MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 19.72ms. Allocated memory is still 244.3MB. Free memory was 185.0MB in the beginning and 183.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 20.34ms. Allocated memory is still 244.3MB. Free memory was 183.4MB in the beginning and 181.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 263.78ms. Allocated memory is still 244.3MB. Free memory was 181.3MB in the beginning and 169.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
 * TraceAbstraction took 66415.10ms. Allocated memory was 244.3MB in the beginning and 293.6MB in the end (delta: 49.3MB). Free memory was 168.7MB in the beginning and 215.4MB in the end (delta: -46.6MB). Peak memory consumption was 138.5MB. Max. memory is 8.0GB.
 * 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: 17]: 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 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.4s, OverallIterations: 13, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 395 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 360 mSDsluCounter, 2911 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2478 mSDsCounter, 295 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2313 IncrementalHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 295 mSolverCounterUnsat, 433 mSDtfsCounter, 2313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1430 GetRequests, 1224 SyntacticMatches, 2 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 15.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=8, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 70 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 100 PreInvPairs, 141 NumberOfFragments, 1123 HoareAnnotationTreeSize, 100 FormulaSimplifications, 13777 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FormulaSimplificationsInter, 2116 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 50.5s InterpolantComputationTime, 854 NumberOfCodeBlocks, 827 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1393 ConstructedInterpolants, 0 QuantifiedInterpolants, 19140 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1683 ConjunctsInSsa, 263 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 3830/4215 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: 46]: Loop Invariant
    Derived loop invariant: (((((((((((p == 1) && (d == (B % 4294967296))) && (q == 0)) && ((B % 4294967296) <= 2)) && (r == (A % 4294967296))) && ((r + 1) <= (B % 4294967296))) || ((((((d == 1) && (p == 1)) && ((B % 4294967296) == 1)) && (r == 0)) && (2 == q)) && (2 == (A % 4294967296)))) || ((((((2 == p) && ((B % 4294967296) == 1)) && (r == 0)) && (2 == q)) && (2 == (A % 4294967296))) && (2 == d))) || (((((((p == 4) && (d <= (2 * r))) && (r <= 2)) && (q == 0)) && (r == (A % 4294967296))) && ((r + 1) <= d)) && (((d / 2) + (A % 4294967296)) == ((2 * (B % 4294967296)) + r)))) || (((((((p == 1) && (1 <= (B % 4294967296))) && (q == 1)) && ((B % 4294967296) <= 2)) && (1 <= (d + r))) && ((d + r) == (A % 4294967296))) && ((d + (A % 4294967296)) == ((2 * (B % 4294967296)) + r)))) || (((((((d <= (2 * r)) && (2 == p)) && ((2 * (B % 4294967296)) == d)) && (q == 0)) && ((B % 4294967296) <= 2)) && (r == (A % 4294967296))) && ((r + 1) <= d)))
  - InvariantResult [Line: 36]: Loop Invariant
    Derived loop invariant: (((((((((p == 1) && (d == (B % 4294967296))) && (r <= 2)) && (q == 0)) && (1 <= d)) && ((B % 4294967296) <= 2)) && (r == (A % 4294967296))) || (((((((d <= (2 * r)) && (2 == p)) && ((2 * (B % 4294967296)) == d)) && (r <= 2)) && (q == 0)) && (1 <= d)) && (r == (A % 4294967296)))) || ((((((((p == 4) && (d <= (2 * r))) && (r <= 2)) && (q == 0)) && (1 <= d)) && (r == (A % 4294967296))) && ((d % 2) == 0)) && (((d / 2) + (A % 4294967296)) == ((2 * (B % 4294967296)) + r))))
RESULT: Ultimate proved your program to be correct!
[2023-12-16 05:11:16,357 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...