/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/bitvector/num_conversion_2.c


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


This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m
[2023-12-16 00:30:07,215 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-12-16 00:30:07,282 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 00:30:07,287 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-12-16 00:30:07,287 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-12-16 00:30:07,311 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-12-16 00:30:07,312 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-12-16 00:30:07,312 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-12-16 00:30:07,312 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-12-16 00:30:07,315 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2023-12-16 00:30:07,316 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-12-16 00:30:07,316 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-12-16 00:30:07,316 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-12-16 00:30:07,317 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-12-16 00:30:07,318 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-12-16 00:30:07,318 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-12-16 00:30:07,318 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-12-16 00:30:07,318 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-12-16 00:30:07,318 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-12-16 00:30:07,318 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-12-16 00:30:07,318 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-12-16 00:30:07,319 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-12-16 00:30:07,319 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-12-16 00:30:07,319 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-12-16 00:30:07,319 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2023-12-16 00:30:07,319 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-12-16 00:30:07,319 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-12-16 00:30:07,320 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-12-16 00:30:07,320 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-12-16 00:30:07,320 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-12-16 00:30:07,321 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2023-12-16 00:30:07,321 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-12-16 00:30:07,321 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-16 00:30:07,321 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-12-16 00:30:07,321 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-12-16 00:30:07,322 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-12-16 00:30:07,322 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-12-16 00:30:07,322 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-12-16 00:30:07,322 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-12-16 00:30:07,322 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-12-16 00:30:07,322 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-12-16 00:30:07,322 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-12-16 00:30:07,322 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-12-16 00:30:07,322 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 00:30:07,526 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-12-16 00:30:07,551 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-12-16 00:30:07,553 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-12-16 00:30:07,554 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-12-16 00:30:07,558 INFO  L274        PluginConnector]: CDTParser initialized
[2023-12-16 00:30:07,559 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/num_conversion_2.c
[2023-12-16 00:30:08,650 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-12-16 00:30:08,790 INFO  L384              CDTParser]: Found 1 translation units.
[2023-12-16 00:30:08,791 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/num_conversion_2.c
[2023-12-16 00:30:08,795 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989243455/4d6dc8846ded4b92a7d6900c4677b707/FLAG81b546fcd
[2023-12-16 00:30:08,805 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989243455/4d6dc8846ded4b92a7d6900c4677b707
[2023-12-16 00:30:08,807 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-12-16 00:30:08,808 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-12-16 00:30:08,809 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-12-16 00:30:08,809 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-12-16 00:30:08,812 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-12-16 00:30:08,812 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:30:08" (1/1) ...
[2023-12-16 00:30:08,813 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f63ffda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08, skipping insertion in model container
[2023-12-16 00:30:08,813 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:30:08" (1/1) ...
[2023-12-16 00:30:08,826 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-12-16 00:30:08,933 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/num_conversion_2.c[685,698]
[2023-12-16 00:30:08,944 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-16 00:30:08,953 INFO  L202         MainTranslator]: Completed pre-run
[2023-12-16 00:30:08,960 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/num_conversion_2.c[685,698]
[2023-12-16 00:30:08,967 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-16 00:30:08,977 INFO  L206         MainTranslator]: Completed translation
[2023-12-16 00:30:08,977 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08 WrapperNode
[2023-12-16 00:30:08,977 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-12-16 00:30:08,978 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-12-16 00:30:08,978 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-12-16 00:30:08,978 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-12-16 00:30:08,983 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08" (1/1) ...
[2023-12-16 00:30:08,987 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08" (1/1) ...
[2023-12-16 00:30:08,999 INFO  L138                Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39
[2023-12-16 00:30:08,999 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-12-16 00:30:08,999 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-12-16 00:30:09,000 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-12-16 00:30:09,000 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-12-16 00:30:09,007 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08" (1/1) ...
[2023-12-16 00:30:09,007 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08" (1/1) ...
[2023-12-16 00:30:09,008 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08" (1/1) ...
[2023-12-16 00:30:09,015 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 00:30:09,015 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08" (1/1) ...
[2023-12-16 00:30:09,015 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08" (1/1) ...
[2023-12-16 00:30:09,017 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08" (1/1) ...
[2023-12-16 00:30:09,019 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08" (1/1) ...
[2023-12-16 00:30:09,019 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08" (1/1) ...
[2023-12-16 00:30:09,020 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08" (1/1) ...
[2023-12-16 00:30:09,021 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-12-16 00:30:09,021 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-12-16 00:30:09,021 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-12-16 00:30:09,021 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-12-16 00:30:09,022 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08" (1/1) ...
[2023-12-16 00:30:09,025 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-16 00:30:09,032 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 00:30:09,059 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 00:30:09,098 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 00:30:09,115 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-12-16 00:30:09,116 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-12-16 00:30:09,116 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-12-16 00:30:09,116 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2023-12-16 00:30:09,171 INFO  L241             CfgBuilder]: Building ICFG
[2023-12-16 00:30:09,172 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-12-16 00:30:09,287 INFO  L282             CfgBuilder]: Performing block encoding
[2023-12-16 00:30:09,301 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-12-16 00:30:09,301 INFO  L309             CfgBuilder]: Removed 1 assume(true) statements.
[2023-12-16 00:30:09,301 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:30:09 BoogieIcfgContainer
[2023-12-16 00:30:09,302 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-12-16 00:30:09,303 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-12-16 00:30:09,303 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-12-16 00:30:09,305 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-12-16 00:30:09,306 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:30:08" (1/3) ...
[2023-12-16 00:30:09,306 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bb13ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:30:09, skipping insertion in model container
[2023-12-16 00:30:09,306 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:08" (2/3) ...
[2023-12-16 00:30:09,306 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bb13ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:30:09, skipping insertion in model container
[2023-12-16 00:30:09,306 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:30:09" (3/3) ...
[2023-12-16 00:30:09,307 INFO  L112   eAbstractionObserver]: Analyzing ICFG num_conversion_2.c
[2023-12-16 00:30:09,324 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-12-16 00:30:09,324 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-12-16 00:30:09,366 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-12-16 00:30:09,371 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;@500bca46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-12-16 00:30:09,371 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-12-16 00:30:09,374 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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 00:30:09,377 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2023-12-16 00:30:09,378 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 00:30:09,378 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2023-12-16 00:30:09,378 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 00:30:09,382 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 00:30:09,382 INFO  L85        PathProgramCache]: Analyzing trace with hash 64340713, now seen corresponding path program 1 times
[2023-12-16 00:30:09,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 00:30:09,388 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286330763]
[2023-12-16 00:30:09,388 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 00:30:09,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 00:30:09,466 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 00:30:09,509 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-12-16 00:30:09,509 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 00:30:09,510 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286330763]
[2023-12-16 00:30:09,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286330763] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-16 00:30:09,511 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-16 00:30:09,511 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-12-16 00:30:09,512 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909889992]
[2023-12-16 00:30:09,513 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-16 00:30:09,516 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-12-16 00:30:09,517 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 00:30:09,544 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-12-16 00:30:09,544 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-12-16 00:30:09,545 INFO  L87              Difference]: Start difference. First operand  has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 00:30:09,562 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 00:30:09,562 INFO  L93              Difference]: Finished difference Result 16 states and 19 transitions.
[2023-12-16 00:30:09,563 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-12-16 00:30:09,564 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5
[2023-12-16 00:30:09,564 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 00:30:09,569 INFO  L225             Difference]: With dead ends: 16
[2023-12-16 00:30:09,569 INFO  L226             Difference]: Without dead ends: 8
[2023-12-16 00:30:09,571 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 00:30:09,575 INFO  L413           NwaCegarLoop]: 9 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, 9 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 00:30:09,576 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-16 00:30:09,587 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8 states.
[2023-12-16 00:30:09,594 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8.
[2023-12-16 00:30:09,595 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 00:30:09,595 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions.
[2023-12-16 00:30:09,596 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5
[2023-12-16 00:30:09,596 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 00:30:09,596 INFO  L495      AbstractCegarLoop]: Abstraction has 8 states and 9 transitions.
[2023-12-16 00:30:09,597 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 00:30:09,597 INFO  L276                IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions.
[2023-12-16 00:30:09,597 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2023-12-16 00:30:09,597 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 00:30:09,597 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2023-12-16 00:30:09,597 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-12-16 00:30:09,598 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 00:30:09,598 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 00:30:09,598 INFO  L85        PathProgramCache]: Analyzing trace with hash 64013012, now seen corresponding path program 1 times
[2023-12-16 00:30:09,598 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 00:30:09,598 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568714397]
[2023-12-16 00:30:09,598 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 00:30:09,599 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 00:30:09,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 00:30:09,694 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-12-16 00:30:09,695 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 00:30:09,695 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568714397]
[2023-12-16 00:30:09,695 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568714397] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-16 00:30:09,695 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-16 00:30:09,695 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-12-16 00:30:09,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289558248]
[2023-12-16 00:30:09,695 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-16 00:30:09,696 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-12-16 00:30:09,696 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 00:30:09,697 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-12-16 00:30:09,697 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-12-16 00:30:09,697 INFO  L87              Difference]: Start difference. First operand 8 states and 9 transitions. Second operand  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 00:30:09,708 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 00:30:09,708 INFO  L93              Difference]: Finished difference Result 15 states and 17 transitions.
[2023-12-16 00:30:09,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-12-16 00:30:09,711 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5
[2023-12-16 00:30:09,711 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 00:30:09,711 INFO  L225             Difference]: With dead ends: 15
[2023-12-16 00:30:09,711 INFO  L226             Difference]: Without dead ends: 11
[2023-12-16 00:30:09,712 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-12-16 00:30:09,713 INFO  L413           NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-16 00:30:09,713 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-16 00:30:09,714 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11 states.
[2023-12-16 00:30:09,715 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9.
[2023-12-16 00:30:09,716 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 00:30:09,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions.
[2023-12-16 00:30:09,716 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5
[2023-12-16 00:30:09,716 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 00:30:09,716 INFO  L495      AbstractCegarLoop]: Abstraction has 9 states and 10 transitions.
[2023-12-16 00:30:09,716 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 00:30:09,717 INFO  L276                IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions.
[2023-12-16 00:30:09,717 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2023-12-16 00:30:09,717 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 00:30:09,717 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 00:30:09,717 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-12-16 00:30:09,717 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 00:30:09,718 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 00:30:09,718 INFO  L85        PathProgramCache]: Analyzing trace with hash 1642414583, now seen corresponding path program 1 times
[2023-12-16 00:30:09,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 00:30:09,718 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935030261]
[2023-12-16 00:30:09,718 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 00:30:09,718 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 00:30:09,732 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 00:30:09,827 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-12-16 00:30:09,827 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 00:30:09,828 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935030261]
[2023-12-16 00:30:09,828 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935030261] provided 0 perfect and 1 imperfect interpolant sequences
[2023-12-16 00:30:09,828 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001307713]
[2023-12-16 00:30:09,828 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 00:30:09,828 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 00:30:09,828 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 00:30:09,860 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 00:30:09,868 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 00:30:09,902 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 00:30:09,906 INFO  L262         TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-12-16 00:30:09,908 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-16 00:30:09,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-12-16 00:30:09,942 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-16 00:30:09,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-12-16 00:30:09,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001307713] provided 0 perfect and 2 imperfect interpolant sequences
[2023-12-16 00:30:09,984 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-12-16 00:30:09,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 7
[2023-12-16 00:30:09,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128078535]
[2023-12-16 00:30:09,985 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-12-16 00:30:09,985 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-12-16 00:30:09,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 00:30:09,985 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-12-16 00:30:09,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56
[2023-12-16 00:30:09,986 INFO  L87              Difference]: Start difference. First operand 9 states and 10 transitions. Second operand  has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 00:30:10,032 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 00:30:10,032 INFO  L93              Difference]: Finished difference Result 22 states and 28 transitions.
[2023-12-16 00:30:10,033 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-12-16 00:30:10,033 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2023-12-16 00:30:10,033 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 00:30:10,034 INFO  L225             Difference]: With dead ends: 22
[2023-12-16 00:30:10,034 INFO  L226             Difference]: Without dead ends: 18
[2023-12-16 00:30:10,034 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72
[2023-12-16 00:30:10,035 INFO  L413           NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-16 00:30:10,035 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-16 00:30:10,036 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18 states.
[2023-12-16 00:30:10,037 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18.
[2023-12-16 00:30:10,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 00:30:10,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions.
[2023-12-16 00:30:10,038 INFO  L78                 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8
[2023-12-16 00:30:10,038 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 00:30:10,038 INFO  L495      AbstractCegarLoop]: Abstraction has 18 states and 22 transitions.
[2023-12-16 00:30:10,038 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 00:30:10,038 INFO  L276                IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions.
[2023-12-16 00:30:10,040 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2023-12-16 00:30:10,041 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 00:30:10,041 INFO  L195           NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1]
[2023-12-16 00:30:10,046 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-12-16 00:30:10,246 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 00:30:10,246 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 00:30:10,247 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 00:30:10,247 INFO  L85        PathProgramCache]: Analyzing trace with hash -1801159404, now seen corresponding path program 2 times
[2023-12-16 00:30:10,248 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 00:30:10,248 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722171403]
[2023-12-16 00:30:10,248 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 00:30:10,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 00:30:10,262 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 00:30:10,436 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-12-16 00:30:10,436 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 00:30:10,436 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722171403]
[2023-12-16 00:30:10,437 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722171403] provided 0 perfect and 1 imperfect interpolant sequences
[2023-12-16 00:30:10,437 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947001358]
[2023-12-16 00:30:10,437 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-12-16 00:30:10,437 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-16 00:30:10,437 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 00:30:10,441 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 00:30:10,450 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 00:30:10,488 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-12-16 00:30:10,488 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-12-16 00:30:10,489 INFO  L262         TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 13 conjunts are in the unsatisfiable core
[2023-12-16 00:30:10,490 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-16 00:30:10,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-12-16 00:30:10,531 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-16 00:30:10,682 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-12-16 00:30:10,683 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [947001358] provided 0 perfect and 2 imperfect interpolant sequences
[2023-12-16 00:30:10,684 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-12-16 00:30:10,685 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16
[2023-12-16 00:30:10,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362657756]
[2023-12-16 00:30:10,685 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-12-16 00:30:10,688 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2023-12-16 00:30:10,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 00:30:10,690 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2023-12-16 00:30:10,690 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272
[2023-12-16 00:30:10,691 INFO  L87              Difference]: Start difference. First operand 18 states and 22 transitions. Second operand  has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 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 00:30:10,924 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 00:30:10,924 INFO  L93              Difference]: Finished difference Result 40 states and 55 transitions.
[2023-12-16 00:30:10,925 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2023-12-16 00:30:10,925 INFO  L78                 Accepts]: Start accepts. Automaton has  has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17
[2023-12-16 00:30:10,925 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 00:30:10,925 INFO  L225             Difference]: With dead ends: 40
[2023-12-16 00:30:10,926 INFO  L226             Difference]: Without dead ends: 36
[2023-12-16 00:30:10,926 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462
[2023-12-16 00:30:10,927 INFO  L413           NwaCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-16 00:30:10,927 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 109 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-16 00:30:10,927 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2023-12-16 00:30:10,931 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2023-12-16 00:30:10,931 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 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 00:30:10,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions.
[2023-12-16 00:30:10,935 INFO  L78                 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 17
[2023-12-16 00:30:10,935 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 00:30:10,935 INFO  L495      AbstractCegarLoop]: Abstraction has 36 states and 47 transitions.
[2023-12-16 00:30:10,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 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 00:30:10,936 INFO  L276                IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions.
[2023-12-16 00:30:10,937 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2023-12-16 00:30:10,937 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 00:30:10,937 INFO  L195           NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1]
[2023-12-16 00:30:10,945 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-12-16 00:30:11,142 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3
[2023-12-16 00:30:11,143 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 00:30:11,143 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 00:30:11,143 INFO  L85        PathProgramCache]: Analyzing trace with hash 1416812372, now seen corresponding path program 3 times
[2023-12-16 00:30:11,143 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 00:30:11,143 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910423379]
[2023-12-16 00:30:11,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 00:30:11,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 00:30:11,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-16 00:30:11,191 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-12-16 00:30:11,211 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-16 00:30:11,247 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-12-16 00:30:11,248 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-12-16 00:30:11,249 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-12-16 00:30:11,250 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-12-16 00:30:11,253 INFO  L445         BasicCegarLoop]: Path program histogram: [3, 1, 1]
[2023-12-16 00:30:11,264 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2023-12-16 00:30:11,282 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:30:11 BoogieIcfgContainer
[2023-12-16 00:30:11,282 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-12-16 00:30:11,283 INFO  L158              Benchmark]: Toolchain (without parser) took 2474.84ms. Allocated memory is still 248.5MB. Free memory was 200.7MB in the beginning and 135.0MB in the end (delta: 65.7MB). Peak memory consumption was 67.0MB. Max. memory is 8.0GB.
[2023-12-16 00:30:11,283 INFO  L158              Benchmark]: CDTParser took 0.09ms. Allocated memory is still 206.6MB. Free memory is still 161.5MB. There was no memory consumed. Max. memory is 8.0GB.
[2023-12-16 00:30:11,283 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 168.75ms. Allocated memory is still 248.5MB. Free memory was 200.4MB in the beginning and 189.5MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2023-12-16 00:30:11,283 INFO  L158              Benchmark]: Boogie Procedure Inliner took 21.01ms. Allocated memory is still 248.5MB. Free memory was 189.5MB in the beginning and 188.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2023-12-16 00:30:11,283 INFO  L158              Benchmark]: Boogie Preprocessor took 21.29ms. Allocated memory is still 248.5MB. Free memory was 188.1MB in the beginning and 186.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2023-12-16 00:30:11,284 INFO  L158              Benchmark]: RCFGBuilder took 280.40ms. Allocated memory is still 248.5MB. Free memory was 186.4MB in the beginning and 175.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
[2023-12-16 00:30:11,284 INFO  L158              Benchmark]: TraceAbstraction took 1979.23ms. Allocated memory is still 248.5MB. Free memory was 175.2MB in the beginning and 135.0MB in the end (delta: 40.3MB). Peak memory consumption was 41.8MB. Max. memory is 8.0GB.
[2023-12-16 00:30:11,285 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.09ms. Allocated memory is still 206.6MB. Free memory is still 161.5MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 168.75ms. Allocated memory is still 248.5MB. Free memory was 200.4MB in the beginning and 189.5MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 21.01ms. Allocated memory is still 248.5MB. Free memory was 189.5MB in the beginning and 188.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 21.29ms. Allocated memory is still 248.5MB. Free memory was 188.1MB in the beginning and 186.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 280.40ms. Allocated memory is still 248.5MB. Free memory was 186.4MB in the beginning and 175.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
 * TraceAbstraction took 1979.23ms. Allocated memory is still 248.5MB. Free memory was 175.2MB in the beginning and 135.0MB in the end (delta: 40.3MB). Peak memory consumption was 41.8MB. 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
  - UnprovableResult [Line: 16]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: overapproximation of bitwise operation at line 31. 
Possible FailurePath: 
[L24]                        unsigned char x = __VERIFIER_nondet_uchar();
[L25]                        unsigned char y;
[L26]                        unsigned char c;
[L28]                        y = 0
[L29]                        c = 0
           VAL               [c=0, y=0]
[L30]      COND TRUE         c < (unsigned char)8
[L31]      EXPR              ((unsigned char)1) << c
[L31]                        unsigned char i = ((unsigned char)1) << c;
[L32]      EXPR              x & i
[L32]                        unsigned char bit = x & i;
[L33]      COND FALSE, EXPR  !(bit != (unsigned char)0)
           VAL               [bit=0, c=0, i=0, y=0]
[L36]      EXPR              c = c + ((unsigned char)1)
[L30-L37]                    {
        unsigned char i = ((unsigned char)1) << c;
        unsigned char bit = x & i;
        if (bit != (unsigned char)0) {
            y = y + i;
        }
        c = c + ((unsigned char)1);
    }
           VAL               [c=1, y=0]
[L30]      COND TRUE         c < (unsigned char)8
[L31]      EXPR              ((unsigned char)1) << c
[L31]                        unsigned char i = ((unsigned char)1) << c;
[L32]      EXPR              x & i
[L32]                        unsigned char bit = x & i;
[L33]      COND FALSE, EXPR  !(bit != (unsigned char)0)
           VAL               [bit=0, c=1, i=0, y=0]
[L36]      EXPR              c = c + ((unsigned char)1)
[L30-L37]                    {
        unsigned char i = ((unsigned char)1) << c;
        unsigned char bit = x & i;
        if (bit != (unsigned char)0) {
            y = y + i;
        }
        c = c + ((unsigned char)1);
    }
           VAL               [c=2, y=0]
[L30]      COND TRUE         c < (unsigned char)8
[L31]      EXPR              ((unsigned char)1) << c
[L31]                        unsigned char i = ((unsigned char)1) << c;
[L32]      EXPR              x & i
[L32]                        unsigned char bit = x & i;
[L33]      COND FALSE, EXPR  !(bit != (unsigned char)0)
           VAL               [bit=0, c=2, i=0, y=0]
[L36]      EXPR              c = c + ((unsigned char)1)
[L30-L37]                    {
        unsigned char i = ((unsigned char)1) << c;
        unsigned char bit = x & i;
        if (bit != (unsigned char)0) {
            y = y + i;
        }
        c = c + ((unsigned char)1);
    }
           VAL               [c=3, y=0]
[L30]      COND TRUE         c < (unsigned char)8
[L31]      EXPR              ((unsigned char)1) << c
[L31]                        unsigned char i = ((unsigned char)1) << c;
[L32]      EXPR              x & i
[L32]                        unsigned char bit = x & i;
[L33]      COND FALSE, EXPR  !(bit != (unsigned char)0)
           VAL               [bit=0, c=3, i=0, y=0]
[L36]      EXPR              c = c + ((unsigned char)1)
[L30-L37]                    {
        unsigned char i = ((unsigned char)1) << c;
        unsigned char bit = x & i;
        if (bit != (unsigned char)0) {
            y = y + i;
        }
        c = c + ((unsigned char)1);
    }
           VAL               [c=4, y=0]
[L30]      COND TRUE         c < (unsigned char)8
[L31]      EXPR              ((unsigned char)1) << c
[L31]                        unsigned char i = ((unsigned char)1) << c;
[L32]      EXPR              x & i
[L32]                        unsigned char bit = x & i;
[L33]      COND FALSE, EXPR  !(bit != (unsigned char)0)
           VAL               [bit=0, c=4, i=0, y=0]
[L36]      EXPR              c = c + ((unsigned char)1)
[L30-L37]                    {
        unsigned char i = ((unsigned char)1) << c;
        unsigned char bit = x & i;
        if (bit != (unsigned char)0) {
            y = y + i;
        }
        c = c + ((unsigned char)1);
    }
           VAL               [c=5, y=0]
[L30]      COND TRUE         c < (unsigned char)8
[L31]      EXPR              ((unsigned char)1) << c
[L31]                        unsigned char i = ((unsigned char)1) << c;
[L32]      EXPR              x & i
[L32]                        unsigned char bit = x & i;
[L33]      COND FALSE, EXPR  !(bit != (unsigned char)0)
           VAL               [bit=0, c=5, i=0, y=0]
[L36]      EXPR              c = c + ((unsigned char)1)
[L30-L37]                    {
        unsigned char i = ((unsigned char)1) << c;
        unsigned char bit = x & i;
        if (bit != (unsigned char)0) {
            y = y + i;
        }
        c = c + ((unsigned char)1);
    }
           VAL               [c=6, y=0]
[L30]      COND TRUE         c < (unsigned char)8
[L31]      EXPR              ((unsigned char)1) << c
[L31]                        unsigned char i = ((unsigned char)1) << c;
[L32]      EXPR              x & i
[L32]                        unsigned char bit = x & i;
[L33]      COND FALSE, EXPR  !(bit != (unsigned char)0)
           VAL               [bit=0, c=6, i=0, y=0]
[L36]      EXPR              c = c + ((unsigned char)1)
[L30-L37]                    {
        unsigned char i = ((unsigned char)1) << c;
        unsigned char bit = x & i;
        if (bit != (unsigned char)0) {
            y = y + i;
        }
        c = c + ((unsigned char)1);
    }
           VAL               [c=7, y=0]
[L30]      COND TRUE         c < (unsigned char)8
[L31]      EXPR              ((unsigned char)1) << c
[L31]                        unsigned char i = ((unsigned char)1) << c;
[L32]      EXPR              x & i
[L32]                        unsigned char bit = x & i;
[L33]      COND FALSE, EXPR  !(bit != (unsigned char)0)
           VAL               [bit=0, c=7, i=0, y=0]
[L36]      EXPR              c = c + ((unsigned char)1)
[L30-L37]                    {
        unsigned char i = ((unsigned char)1) << c;
        unsigned char bit = x & i;
        if (bit != (unsigned char)0) {
            y = y + i;
        }
        c = c + ((unsigned char)1);
    }
           VAL               [c=8, y=0]
[L30]      COND FALSE        !(c < (unsigned char)8)
           VAL               [c=8, y=0]
[L38]      CALL              __VERIFIER_assert(x == y)
[L15]      COND TRUE         !(cond)
           VAL               [\old(cond)=0, cond=0]
[L16]                        reach_error()
           VAL               [\old(cond)=0, cond=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 126 IncrementalHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 36 mSDtfsCounter, 126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=4, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 431 SizeOfPredicates, 0 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/69 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
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2023-12-16 00:30:11,298 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...