/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-64bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p02.c


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


This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m
[2023-12-16 19:59:42,223 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-12-16 19:59:42,291 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf
[2023-12-16 19:59:42,295 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-12-16 19:59:42,295 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-12-16 19:59:42,315 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-12-16 19:59:42,316 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-12-16 19:59:42,316 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-12-16 19:59:42,316 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-12-16 19:59:42,319 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2023-12-16 19:59:42,319 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-12-16 19:59:42,320 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-12-16 19:59:42,320 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-12-16 19:59:42,321 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-12-16 19:59:42,321 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-12-16 19:59:42,321 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-12-16 19:59:42,321 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-12-16 19:59:42,321 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-12-16 19:59:42,322 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-12-16 19:59:42,323 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-12-16 19:59:42,323 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-12-16 19:59:42,323 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-12-16 19:59:42,323 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2023-12-16 19:59:42,323 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-12-16 19:59:42,323 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-12-16 19:59:42,324 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-12-16 19:59:42,324 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-12-16 19:59:42,324 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2023-12-16 19:59:42,324 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-12-16 19:59:42,324 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-16 19:59:42,325 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-12-16 19:59:42,325 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-12-16 19:59:42,325 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-12-16 19:59:42,326 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-12-16 19:59:42,326 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-12-16 19:59:42,326 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-12-16 19:59:42,326 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-12-16 19:59:42,326 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-12-16 19:59:42,327 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-12-16 19:59:42,327 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-12-16 19:59:42,327 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 -> true
[2023-12-16 19:59:42,513 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-12-16 19:59:42,530 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-12-16 19:59:42,531 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-12-16 19:59:42,532 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-12-16 19:59:42,546 INFO  L274        PluginConnector]: CDTParser initialized
[2023-12-16 19:59:42,548 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p02.c
[2023-12-16 19:59:43,541 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-12-16 19:59:43,688 INFO  L384              CDTParser]: Found 1 translation units.
[2023-12-16 19:59:43,689 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p02.c
[2023-12-16 19:59:43,695 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c87a49b0/99e6aa46e3b347db9ac7cbfe56fbda25/FLAGc185e468d
[2023-12-16 19:59:43,707 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c87a49b0/99e6aa46e3b347db9ac7cbfe56fbda25
[2023-12-16 19:59:43,709 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-12-16 19:59:43,710 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-12-16 19:59:43,711 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-12-16 19:59:43,711 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-12-16 19:59:43,714 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-12-16 19:59:43,715 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:59:43" (1/1) ...
[2023-12-16 19:59:43,715 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5b3fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43, skipping insertion in model container
[2023-12-16 19:59:43,716 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:59:43" (1/1) ...
[2023-12-16 19:59:43,736 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-12-16 19:59:43,854 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p02.c[1266,1279]
[2023-12-16 19:59:43,893 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-16 19:59:43,900 INFO  L202         MainTranslator]: Completed pre-run
[2023-12-16 19:59:43,909 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p02.c[1266,1279]
[2023-12-16 19:59:43,929 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-16 19:59:43,938 INFO  L206         MainTranslator]: Completed translation
[2023-12-16 19:59:43,939 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43 WrapperNode
[2023-12-16 19:59:43,939 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-12-16 19:59:43,940 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-12-16 19:59:43,940 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-12-16 19:59:43,940 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-12-16 19:59:43,945 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43" (1/1) ...
[2023-12-16 19:59:43,950 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43" (1/1) ...
[2023-12-16 19:59:43,989 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 238
[2023-12-16 19:59:43,990 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-12-16 19:59:43,990 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-12-16 19:59:43,990 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-12-16 19:59:43,990 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-12-16 19:59:43,998 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43" (1/1) ...
[2023-12-16 19:59:43,998 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43" (1/1) ...
[2023-12-16 19:59:44,002 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43" (1/1) ...
[2023-12-16 19:59:44,023 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 19:59:44,023 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43" (1/1) ...
[2023-12-16 19:59:44,023 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43" (1/1) ...
[2023-12-16 19:59:44,029 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43" (1/1) ...
[2023-12-16 19:59:44,031 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43" (1/1) ...
[2023-12-16 19:59:44,033 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43" (1/1) ...
[2023-12-16 19:59:44,034 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43" (1/1) ...
[2023-12-16 19:59:44,052 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-12-16 19:59:44,053 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-12-16 19:59:44,053 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-12-16 19:59:44,053 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-12-16 19:59:44,054 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43" (1/1) ...
[2023-12-16 19:59:44,059 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-16 19:59:44,070 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-16 19:59:44,081 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 19:59:44,184 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 19:59:44,190 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-12-16 19:59:44,190 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2023-12-16 19:59:44,190 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-12-16 19:59:44,190 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-12-16 19:59:44,275 INFO  L241             CfgBuilder]: Building ICFG
[2023-12-16 19:59:44,277 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-12-16 19:59:44,506 INFO  L282             CfgBuilder]: Performing block encoding
[2023-12-16 19:59:44,569 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-12-16 19:59:44,569 INFO  L309             CfgBuilder]: Removed 1 assume(true) statements.
[2023-12-16 19:59:44,570 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:59:44 BoogieIcfgContainer
[2023-12-16 19:59:44,570 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-12-16 19:59:44,571 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-12-16 19:59:44,572 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-12-16 19:59:44,574 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-12-16 19:59:44,574 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:59:43" (1/3) ...
[2023-12-16 19:59:44,574 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b16710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:59:44, skipping insertion in model container
[2023-12-16 19:59:44,574 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:43" (2/3) ...
[2023-12-16 19:59:44,575 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b16710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:59:44, skipping insertion in model container
[2023-12-16 19:59:44,575 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:59:44" (3/3) ...
[2023-12-16 19:59:44,576 INFO  L112   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p02.c
[2023-12-16 19:59:44,587 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-12-16 19:59:44,587 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-12-16 19:59:44,646 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-12-16 19:59:44,651 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;@4b12d5fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-12-16 19:59:44,651 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-12-16 19:59:44,654 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 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 19:59:44,658 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2023-12-16 19:59:44,659 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 19:59:44,659 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 19:59:44,660 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 19:59:44,666 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 19:59:44,667 INFO  L85        PathProgramCache]: Analyzing trace with hash -1408124024, now seen corresponding path program 1 times
[2023-12-16 19:59:44,673 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 19:59:44,673 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148750910]
[2023-12-16 19:59:44,674 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 19:59:44,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 19:59:44,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 19:59:45,020 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 19:59:45,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 19:59:45,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148750910]
[2023-12-16 19:59:45,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148750910] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-16 19:59:45,022 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-16 19:59:45,022 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-12-16 19:59:45,023 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585815492]
[2023-12-16 19:59:45,024 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-16 19:59:45,026 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-12-16 19:59:45,026 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 19:59:45,051 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-12-16 19:59:45,052 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-16 19:59:45,053 INFO  L87              Difference]: Start difference. First operand  has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 19:59:45,089 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 19:59:45,089 INFO  L93              Difference]: Finished difference Result 45 states and 71 transitions.
[2023-12-16 19:59:45,090 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-12-16 19:59:45,091 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14
[2023-12-16 19:59:45,092 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 19:59:45,096 INFO  L225             Difference]: With dead ends: 45
[2023-12-16 19:59:45,096 INFO  L226             Difference]: Without dead ends: 26
[2023-12-16 19:59:45,098 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-16 19:59:45,101 INFO  L413           NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-16 19:59:45,102 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 94 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-16 19:59:45,112 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2023-12-16 19:59:45,124 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2023-12-16 19:59:45,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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 19:59:45,127 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions.
[2023-12-16 19:59:45,128 INFO  L78                 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 14
[2023-12-16 19:59:45,128 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 19:59:45,128 INFO  L495      AbstractCegarLoop]: Abstraction has 26 states and 38 transitions.
[2023-12-16 19:59:45,129 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 19:59:45,129 INFO  L276                IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions.
[2023-12-16 19:59:45,129 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2023-12-16 19:59:45,129 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 19:59:45,129 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 19:59:45,130 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-12-16 19:59:45,130 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 19:59:45,130 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 19:59:45,130 INFO  L85        PathProgramCache]: Analyzing trace with hash -700446776, now seen corresponding path program 1 times
[2023-12-16 19:59:45,130 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 19:59:45,131 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28542016]
[2023-12-16 19:59:45,131 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 19:59:45,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 19:59:45,159 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 19:59:45,251 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 19:59:45,251 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 19:59:45,252 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28542016]
[2023-12-16 19:59:45,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28542016] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-16 19:59:45,252 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-16 19:59:45,252 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-12-16 19:59:45,252 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407824595]
[2023-12-16 19:59:45,252 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-16 19:59:45,254 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-12-16 19:59:45,257 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 19:59:45,257 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-12-16 19:59:45,258 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-16 19:59:45,258 INFO  L87              Difference]: Start difference. First operand 26 states and 38 transitions. Second operand  has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 19:59:45,284 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 19:59:45,285 INFO  L93              Difference]: Finished difference Result 48 states and 69 transitions.
[2023-12-16 19:59:45,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-12-16 19:59:45,285 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 15
[2023-12-16 19:59:45,285 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 19:59:45,286 INFO  L225             Difference]: With dead ends: 48
[2023-12-16 19:59:45,287 INFO  L226             Difference]: Without dead ends: 29
[2023-12-16 19:59:45,287 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-16 19:59:45,288 INFO  L413           NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-16 19:59:45,289 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 92 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-16 19:59:45,291 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2023-12-16 19:59:45,295 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28.
[2023-12-16 19:59:45,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 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 19:59:45,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions.
[2023-12-16 19:59:45,298 INFO  L78                 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15
[2023-12-16 19:59:45,298 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 19:59:45,298 INFO  L495      AbstractCegarLoop]: Abstraction has 28 states and 40 transitions.
[2023-12-16 19:59:45,298 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 19:59:45,298 INFO  L276                IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions.
[2023-12-16 19:59:45,299 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2023-12-16 19:59:45,299 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 19:59:45,299 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 19:59:45,299 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-12-16 19:59:45,300 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 19:59:45,300 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 19:59:45,300 INFO  L85        PathProgramCache]: Analyzing trace with hash -449445982, now seen corresponding path program 1 times
[2023-12-16 19:59:45,301 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 19:59:45,301 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22050819]
[2023-12-16 19:59:45,301 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 19:59:45,302 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 19:59:45,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-16 19:59:45,517 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 19:59:45,517 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-12-16 19:59:45,518 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22050819]
[2023-12-16 19:59:45,518 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22050819] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-16 19:59:45,518 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-16 19:59:45,518 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-12-16 19:59:45,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926723752]
[2023-12-16 19:59:45,518 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-16 19:59:45,519 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-12-16 19:59:45,519 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-12-16 19:59:45,519 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-12-16 19:59:45,521 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-12-16 19:59:45,521 INFO  L87              Difference]: Start difference. First operand 28 states and 40 transitions. Second operand  has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 19:59:45,571 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-16 19:59:45,572 INFO  L93              Difference]: Finished difference Result 51 states and 73 transitions.
[2023-12-16 19:59:45,572 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-12-16 19:59:45,572 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 16
[2023-12-16 19:59:45,572 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-16 19:59:45,573 INFO  L225             Difference]: With dead ends: 51
[2023-12-16 19:59:45,573 INFO  L226             Difference]: Without dead ends: 30
[2023-12-16 19:59:45,576 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2023-12-16 19:59:45,579 INFO  L413           NwaCegarLoop]: 34 mSDtfsCounter, 70 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-16 19:59:45,580 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 49 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-16 19:59:45,582 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2023-12-16 19:59:45,586 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26.
[2023-12-16 19:59:45,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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 19:59:45,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions.
[2023-12-16 19:59:45,587 INFO  L78                 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 16
[2023-12-16 19:59:45,587 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-16 19:59:45,587 INFO  L495      AbstractCegarLoop]: Abstraction has 26 states and 36 transitions.
[2023-12-16 19:59:45,587 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 19:59:45,587 INFO  L276                IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions.
[2023-12-16 19:59:45,587 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2023-12-16 19:59:45,588 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-16 19:59:45,588 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-16 19:59:45,588 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-12-16 19:59:45,588 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-16 19:59:45,588 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-16 19:59:45,588 INFO  L85        PathProgramCache]: Analyzing trace with hash 1325561380, now seen corresponding path program 1 times
[2023-12-16 19:59:45,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-12-16 19:59:45,588 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469341496]
[2023-12-16 19:59:45,589 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-16 19:59:45,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-16 19:59:45,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-16 19:59:45,630 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-12-16 19:59:45,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-16 19:59:45,671 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-12-16 19:59:45,672 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-12-16 19:59:45,673 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-12-16 19:59:45,674 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-12-16 19:59:45,676 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-12-16 19:59:45,678 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2023-12-16 19:59:45,712 WARN  L320   BoogieBacktranslator]: Removing null node from list of ATEs: ATE  program state null
[2023-12-16 19:59:45,725 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:59:45 BoogieIcfgContainer
[2023-12-16 19:59:45,725 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-12-16 19:59:45,725 INFO  L158              Benchmark]: Toolchain (without parser) took 2015.82ms. Allocated memory was 168.8MB in the beginning and 228.6MB in the end (delta: 59.8MB). Free memory was 107.9MB in the beginning and 179.5MB in the end (delta: -71.6MB). There was no memory consumed. Max. memory is 8.0GB.
[2023-12-16 19:59:45,726 INFO  L158              Benchmark]: CDTParser took 0.10ms. Allocated memory is still 168.8MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 8.0GB.
[2023-12-16 19:59:45,726 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 228.25ms. Allocated memory is still 168.8MB. Free memory was 107.9MB in the beginning and 94.6MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB.
[2023-12-16 19:59:45,726 INFO  L158              Benchmark]: Boogie Procedure Inliner took 49.99ms. Allocated memory is still 168.8MB. Free memory was 94.6MB in the beginning and 91.1MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2023-12-16 19:59:45,726 INFO  L158              Benchmark]: Boogie Preprocessor took 62.52ms. Allocated memory is still 168.8MB. Free memory was 91.1MB in the beginning and 88.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2023-12-16 19:59:45,726 INFO  L158              Benchmark]: RCFGBuilder took 516.71ms. Allocated memory was 168.8MB in the beginning and 228.6MB in the end (delta: 59.8MB). Free memory was 88.0MB in the beginning and 192.8MB in the end (delta: -104.8MB). Peak memory consumption was 24.8MB. Max. memory is 8.0GB.
[2023-12-16 19:59:45,726 INFO  L158              Benchmark]: TraceAbstraction took 1153.75ms. Allocated memory is still 228.6MB. Free memory was 192.0MB in the beginning and 179.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB.
[2023-12-16 19:59:45,727 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 168.8MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 228.25ms. Allocated memory is still 168.8MB. Free memory was 107.9MB in the beginning and 94.6MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 49.99ms. Allocated memory is still 168.8MB. Free memory was 94.6MB in the beginning and 91.1MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 62.52ms. Allocated memory is still 168.8MB. Free memory was 91.1MB in the beginning and 88.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 516.71ms. Allocated memory was 168.8MB in the beginning and 228.6MB in the end (delta: 59.8MB). Free memory was 88.0MB in the beginning and 192.8MB in the end (delta: -104.8MB). Peak memory consumption was 24.8MB. Max. memory is 8.0GB.
 * TraceAbstraction took 1153.75ms. Allocated memory is still 228.6MB. Free memory was 192.0MB in the beginning and 179.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.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: 21]: 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 bitwiseAnd at line 122. 
Possible FailurePath: 
[L26]              const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1);
[L27]              const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1);
[L29]              const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8);
[L30]              const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1);
[L32]              const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 4);
[L33]              const SORT_7 msb_SORT_7 = (SORT_7)1 << (4 - 1);
[L35]              const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 32);
[L36]              const SORT_12 msb_SORT_12 = (SORT_12)1 << (32 - 1);
[L38]              const SORT_66 mask_SORT_66 = (SORT_66)-1 >> (sizeof(SORT_66) * 8 - 10);
[L39]              const SORT_66 msb_SORT_66 = (SORT_66)1 << (10 - 1);
[L41]              const SORT_7 var_8 = 0;
[L42]              const SORT_12 var_14 = 0;
[L43]              const SORT_1 var_18 = 1;
[L44]              const SORT_1 var_22 = 0;
[L46]              SORT_1 input_2;
[L47]              SORT_3 input_4;
[L48]              SORT_1 input_5;
[L49]              SORT_1 input_6;
[L50]              SORT_1 input_25;
[L51]              SORT_1 input_27;
[L52]              SORT_1 input_29;
[L53]              SORT_7 input_31;
[L54]              SORT_1 input_33;
[L55]              SORT_1 input_35;
[L56]              SORT_1 input_37;
[L57]              SORT_1 input_39;
[L58]              SORT_1 input_41;
[L59]              SORT_1 input_43;
[L60]              SORT_1 input_45;
[L61]              SORT_1 input_47;
[L62]              SORT_3 input_49;
[L63]              SORT_1 input_52;
[L64]              SORT_1 input_54;
[L65]              SORT_1 input_56;
[L66]              SORT_1 input_58;
[L67]              SORT_1 input_60;
[L68]              SORT_1 input_62;
[L69]              SORT_1 input_64;
[L70]              SORT_66 input_67;
[L71]              SORT_1 input_69;
[L73]   EXPR       __VERIFIER_nondet_uchar() & mask_SORT_7
        VAL        [mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_3=255, mask_SORT_66=1023, mask_SORT_7=15, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_66=512, msb_SORT_7=8, var_14=0, var_18=1, var_22=0, var_8=0]
[L73]              SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7;
[L74]   EXPR       __VERIFIER_nondet_uchar() & mask_SORT_1
        VAL        [mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_3=255, mask_SORT_66=1023, mask_SORT_7=15, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_66=512, msb_SORT_7=8, state_9=0, var_14=0, var_18=1, var_22=0, var_8=0]
[L74]              SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1;
[L76]              SORT_7 init_10_arg_1 = var_8;
[L77]              state_9 = init_10_arg_1
[L78]              SORT_1 init_24_arg_1 = var_22;
[L79]              state_23 = init_24_arg_1
        VAL        [init_10_arg_1=0, init_24_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_3=255, mask_SORT_66=1023, mask_SORT_7=15, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_66=512, msb_SORT_7=8, state_23=0, state_9=0, var_14=0, var_18=1, var_22=0, var_8=0]
[L82]              input_2 = __VERIFIER_nondet_uchar()
[L83]              input_4 = __VERIFIER_nondet_uchar()
[L84]              input_5 = __VERIFIER_nondet_uchar()
[L85]              input_6 = __VERIFIER_nondet_uchar()
[L86]              input_25 = __VERIFIER_nondet_uchar()
[L87]              input_27 = __VERIFIER_nondet_uchar()
[L88]              input_29 = __VERIFIER_nondet_uchar()
[L89]              input_31 = __VERIFIER_nondet_uchar()
[L90]              input_33 = __VERIFIER_nondet_uchar()
[L91]              input_35 = __VERIFIER_nondet_uchar()
[L92]              input_37 = __VERIFIER_nondet_uchar()
[L93]              input_39 = __VERIFIER_nondet_uchar()
[L94]              input_41 = __VERIFIER_nondet_uchar()
[L95]              input_43 = __VERIFIER_nondet_uchar()
[L96]              input_45 = __VERIFIER_nondet_uchar()
[L97]              input_47 = __VERIFIER_nondet_uchar()
[L98]              input_49 = __VERIFIER_nondet_uchar()
[L99]              input_52 = __VERIFIER_nondet_uchar()
[L100]             input_54 = __VERIFIER_nondet_uchar()
[L101]             input_56 = __VERIFIER_nondet_uchar()
[L102]             input_58 = __VERIFIER_nondet_uchar()
[L103]             input_60 = __VERIFIER_nondet_uchar()
[L104]             input_62 = __VERIFIER_nondet_uchar()
[L105]             input_64 = __VERIFIER_nondet_uchar()
[L106]             input_67 = __VERIFIER_nondet_ushort()
[L107]             input_69 = __VERIFIER_nondet_uchar()
[L110]             SORT_7 var_11_arg_0 = state_9;
[L111]             SORT_1 var_11 = var_11_arg_0 >> 3;
[L112]             SORT_1 var_13_arg_0 = var_11;
        VAL        [init_10_arg_1=0, init_24_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_3=255, mask_SORT_66=1023, mask_SORT_7=15, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_66=512, msb_SORT_7=8, state_23=0, state_9=0, var_11=0, var_11_arg_0=0, var_13_arg_0=0, var_14=0, var_18=1, var_22=0, var_8=0]
[L113]  EXPR       var_13_arg_0 & mask_SORT_1
        VAL        [init_10_arg_1=0, init_24_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_3=255, mask_SORT_66=1023, mask_SORT_7=15, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_66=512, msb_SORT_7=8, state_23=0, state_9=0, var_11=0, var_11_arg_0=0, var_13_arg_0=0, var_14=0, var_18=1, var_22=0, var_8=0]
[L113]             var_13_arg_0 = var_13_arg_0 & mask_SORT_1
[L114]             SORT_12 var_13 = var_13_arg_0;
[L115]             SORT_12 var_15_arg_0 = var_13;
[L116]             SORT_12 var_15_arg_1 = var_14;
[L117]             SORT_1 var_15 = var_15_arg_0 == var_15_arg_1;
[L118]             SORT_1 var_19_arg_0 = var_15;
[L119]             SORT_1 var_19 = ~var_19_arg_0;
[L120]             SORT_1 var_20_arg_0 = var_18;
[L121]             SORT_1 var_20_arg_1 = var_19;
        VAL        [init_10_arg_1=0, init_24_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_3=255, mask_SORT_66=1023, mask_SORT_7=15, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_66=512, msb_SORT_7=8, state_23=0, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_15=1, var_15_arg_0=0, var_15_arg_1=0, var_18=1, var_19=254, var_19_arg_0=1, var_20_arg_0=1, var_20_arg_1=254, var_22=0, var_8=0]
[L122]  EXPR       var_20_arg_0 & var_20_arg_1
        VAL        [init_10_arg_1=0, init_24_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_3=255, mask_SORT_66=1023, mask_SORT_7=15, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_66=512, msb_SORT_7=8, state_23=0, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_15=1, var_15_arg_0=0, var_15_arg_1=0, var_18=1, var_19=254, var_19_arg_0=1, var_20_arg_0=1, var_20_arg_1=254, var_22=0, var_8=0]
[L122]             SORT_1 var_20 = var_20_arg_0 & var_20_arg_1;
[L123]  EXPR       var_20 & mask_SORT_1
        VAL        [init_10_arg_1=0, init_24_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_3=255, mask_SORT_66=1023, mask_SORT_7=15, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_66=512, msb_SORT_7=8, state_23=0, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_15=1, var_15_arg_0=0, var_15_arg_1=0, var_18=1, var_19=254, var_19_arg_0=1, var_20=1, var_20_arg_0=1, var_20_arg_1=254, var_22=0, var_8=0]
[L123]             var_20 = var_20 & mask_SORT_1
[L124]             SORT_1 bad_21_arg_0 = var_20;
[L125]  CALL       __VERIFIER_assert(!(bad_21_arg_0))
[L21]   COND TRUE  !(cond)
        VAL        [\old(cond)=0, cond=0]
[L21]              reach_error()
        VAL        [\old(cond)=0, cond=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 235 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 100 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 99 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 19:59:45,752 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...