/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c


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


This is Ultimate 0.2.5-dev-356b6ba-m
[2024-11-01 18:02:14,583 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-01 18:02:14,648 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf
[2024-11-01 18:02:14,656 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-01 18:02:14,656 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-01 18:02:14,689 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-01 18:02:14,689 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-01 18:02:14,690 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-01 18:02:14,691 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-01 18:02:14,694 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-01 18:02:14,694 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-01 18:02:14,694 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-01 18:02:14,695 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-01 18:02:14,695 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-01 18:02:14,695 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-01 18:02:14,695 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-01 18:02:14,695 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-01 18:02:14,696 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-01 18:02:14,696 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-01 18:02:14,696 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-01 18:02:14,696 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-01 18:02:14,699 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-01 18:02:14,699 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-01 18:02:14,699 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-01 18:02:14,699 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-01 18:02:14,699 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-01 18:02:14,700 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-01 18:02:14,700 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-01 18:02:14,700 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-01 18:02:14,700 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-01 18:02:14,701 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-01 18:02:14,701 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-01 18:02:14,701 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-01 18:02:14,701 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-01 18:02:14,701 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-01 18:02:14,702 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-01 18:02:14,702 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt 
[2024-11-01 18:02:14,702 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-01 18:02:14,703 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-01 18:02:14,703 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-01 18:02:14,703 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-01 18:02:14,704 INFO  L153        SettingsManager]:  * Logic for external solver=AUFBV
[2024-11-01 18:02:14,704 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-01 18:02:15,119 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-01 18:02:15,148 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-01 18:02:15,150 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-01 18:02:15,153 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-01 18:02:15,153 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-01 18:02:15,154 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c
[2024-11-01 18:02:16,582 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-01 18:02:16,830 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-01 18:02:16,830 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c
[2024-11-01 18:02:16,843 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1253bd518/73c3bbfcdcd64acc82e2dbd65805d7d3/FLAG713b1ca81
[2024-11-01 18:02:17,164 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1253bd518/73c3bbfcdcd64acc82e2dbd65805d7d3
[2024-11-01 18:02:17,170 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-01 18:02:17,171 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-11-01 18:02:17,172 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-01 18:02:17,172 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-01 18:02:17,178 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-01 18:02:17,179 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 06:02:17" (1/1) ...
[2024-11-01 18:02:17,180 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366eb0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17, skipping insertion in model container
[2024-11-01 18:02:17,180 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 06:02:17" (1/1) ...
[2024-11-01 18:02:17,202 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-01 18:02:17,379 WARN  L251   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.recount4.c[1258,1271]
[2024-11-01 18:02:17,410 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-01 18:02:17,425 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-01 18:02:17,436 WARN  L251   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.recount4.c[1258,1271]
[2024-11-01 18:02:17,455 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-01 18:02:17,472 INFO  L204         MainTranslator]: Completed translation
[2024-11-01 18:02:17,473 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17 WrapperNode
[2024-11-01 18:02:17,473 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-01 18:02:17,474 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-01 18:02:17,474 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-01 18:02:17,474 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-01 18:02:17,482 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17" (1/1) ...
[2024-11-01 18:02:17,492 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17" (1/1) ...
[2024-11-01 18:02:17,514 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60
[2024-11-01 18:02:17,515 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-01 18:02:17,519 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-01 18:02:17,519 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-01 18:02:17,520 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-01 18:02:17,531 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17" (1/1) ...
[2024-11-01 18:02:17,532 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17" (1/1) ...
[2024-11-01 18:02:17,536 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17" (1/1) ...
[2024-11-01 18:02:17,548 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-01 18:02:17,548 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17" (1/1) ...
[2024-11-01 18:02:17,549 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17" (1/1) ...
[2024-11-01 18:02:17,557 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17" (1/1) ...
[2024-11-01 18:02:17,560 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17" (1/1) ...
[2024-11-01 18:02:17,563 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17" (1/1) ...
[2024-11-01 18:02:17,564 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17" (1/1) ...
[2024-11-01 18:02:17,566 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-01 18:02:17,567 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-01 18:02:17,567 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-01 18:02:17,567 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-01 18:02:17,572 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17" (1/1) ...
[2024-11-01 18:02:17,578 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-01 18:02:17,588 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-01 18:02:17,605 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-01 18:02:17,611 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-01 18:02:17,640 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-01 18:02:17,640 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-01 18:02:17,640 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-01 18:02:17,640 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-01 18:02:17,701 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-01 18:02:17,702 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-01 18:02:17,840 INFO  L?                        ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2024-11-01 18:02:17,841 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-01 18:02:17,854 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-01 18:02:17,855 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-01 18:02:17,856 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 06:02:17 BoogieIcfgContainer
[2024-11-01 18:02:17,856 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-01 18:02:17,858 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-01 18:02:17,858 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-01 18:02:17,861 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-01 18:02:17,861 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 06:02:17" (1/3) ...
[2024-11-01 18:02:17,862 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225fa4d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 06:02:17, skipping insertion in model container
[2024-11-01 18:02:17,862 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:02:17" (2/3) ...
[2024-11-01 18:02:17,862 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225fa4d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 06:02:17, skipping insertion in model container
[2024-11-01 18:02:17,863 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 06:02:17" (3/3) ...
[2024-11-01 18:02:17,864 INFO  L112   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.recount4.c
[2024-11-01 18:02:17,878 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-01 18:02:17,879 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-01 18:02:17,926 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-01 18:02:17,934 INFO  L333      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b486c27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-01 18:02:17,935 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-01 18:02:17,938 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-01 18:02:17,943 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-01 18:02:17,943 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-01 18:02:17,946 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-01 18:02:17,947 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-01 18:02:17,952 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-01 18:02:17,952 INFO  L85        PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times
[2024-11-01 18:02:17,960 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-01 18:02:17,961 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [35890944]
[2024-11-01 18:02:17,961 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-01 18:02:17,963 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-01 18:02:17,963 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-01 18:02:17,967 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-01 18:02:17,988 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-01 18:02:18,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-01 18:02:18,051 INFO  L255         TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-01 18:02:18,057 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-01 18:02:18,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-01 18:02:18,194 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-01 18:02:18,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-01 18:02:18,237 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-01 18:02:18,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [35890944]
[2024-11-01 18:02:18,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [35890944] provided 2 perfect and 0 imperfect interpolant sequences
[2024-11-01 18:02:18,238 INFO  L185   FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences.
[2024-11-01 18:02:18,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6
[2024-11-01 18:02:18,240 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389012912]
[2024-11-01 18:02:18,240 INFO  L85    oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton
[2024-11-01 18:02:18,244 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-01 18:02:18,244 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-01 18:02:18,264 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-01 18:02:18,265 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-01 18:02:18,266 INFO  L87              Difference]: Start difference. First operand  has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-01 18:02:18,306 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-01 18:02:18,306 INFO  L93              Difference]: Finished difference Result 18 states and 23 transitions.
[2024-11-01 18:02:18,309 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-01 18:02:18,310 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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
[2024-11-01 18:02:18,310 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-01 18:02:18,315 INFO  L225             Difference]: With dead ends: 18
[2024-11-01 18:02:18,315 INFO  L226             Difference]: Without dead ends: 10
[2024-11-01 18:02:18,317 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-01 18:02:18,321 INFO  L432           NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-01 18:02:18,322 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-01 18:02:18,335 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10 states.
[2024-11-01 18:02:18,342 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9.
[2024-11-01 18:02:18,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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)
[2024-11-01 18:02:18,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2024-11-01 18:02:18,345 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5
[2024-11-01 18:02:18,345 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-01 18:02:18,345 INFO  L471      AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2024-11-01 18:02:18,345 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-01 18:02:18,346 INFO  L276                IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2024-11-01 18:02:18,346 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-01 18:02:18,346 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-01 18:02:18,346 INFO  L215           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1]
[2024-11-01 18:02:18,355 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-11-01 18:02:18,550 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-01 18:02:18,551 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-01 18:02:18,551 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-01 18:02:18,551 INFO  L85        PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times
[2024-11-01 18:02:18,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-01 18:02:18,552 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2140454735]
[2024-11-01 18:02:18,552 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-01 18:02:18,552 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-01 18:02:18,552 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-01 18:02:18,554 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-01 18:02:18,555 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-01 18:02:18,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-01 18:02:18,630 INFO  L255         TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-01 18:02:18,635 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-01 18:02:18,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-01 18:02:18,867 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-01 18:02:19,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-01 18:02:19,031 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-01 18:02:19,031 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2140454735]
[2024-11-01 18:02:19,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [2140454735] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-01 18:02:19,032 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-01 18:02:19,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2024-11-01 18:02:19,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672925629]
[2024-11-01 18:02:19,032 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-01 18:02:19,033 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-01 18:02:19,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-01 18:02:19,034 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-01 18:02:19,034 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-11-01 18:02:19,034 INFO  L87              Difference]: Start difference. First operand 9 states and 9 transitions. Second operand  has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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)
[2024-11-01 18:02:19,169 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-01 18:02:19,169 INFO  L93              Difference]: Finished difference Result 18 states and 19 transitions.
[2024-11-01 18:02:19,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-01 18:02:19,170 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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 8
[2024-11-01 18:02:19,170 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-01 18:02:19,171 INFO  L225             Difference]: With dead ends: 18
[2024-11-01 18:02:19,171 INFO  L226             Difference]: Without dead ends: 16
[2024-11-01 18:02:19,171 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132
[2024-11-01 18:02:19,172 INFO  L432           NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-01 18:02:19,172 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-01 18:02:19,173 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16 states.
[2024-11-01 18:02:19,194 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15.
[2024-11-01 18:02:19,195 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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)
[2024-11-01 18:02:19,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions.
[2024-11-01 18:02:19,198 INFO  L78                 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8
[2024-11-01 18:02:19,198 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-01 18:02:19,198 INFO  L471      AbstractCegarLoop]: Abstraction has 15 states and 15 transitions.
[2024-11-01 18:02:19,198 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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)
[2024-11-01 18:02:19,198 INFO  L276                IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions.
[2024-11-01 18:02:19,199 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2024-11-01 18:02:19,199 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-01 18:02:19,199 INFO  L215           NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1]
[2024-11-01 18:02:19,211 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-01 18:02:19,400 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-01 18:02:19,402 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-01 18:02:19,402 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-01 18:02:19,403 INFO  L85        PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times
[2024-11-01 18:02:19,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-01 18:02:19,403 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [607593626]
[2024-11-01 18:02:19,403 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-01 18:02:19,403 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-01 18:02:19,403 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-01 18:02:19,405 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-01 18:02:19,406 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-01 18:02:19,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-01 18:02:19,467 INFO  L255         TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjuncts are in the unsatisfiable core
[2024-11-01 18:02:19,470 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-01 18:02:20,037 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-01 18:02:20,038 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-01 18:02:20,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-01 18:02:20,882 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-01 18:02:20,882 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [607593626]
[2024-11-01 18:02:20,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [607593626] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-01 18:02:20,882 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-01 18:02:20,882 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15
[2024-11-01 18:02:20,883 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138330622]
[2024-11-01 18:02:20,883 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-01 18:02:20,883 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-11-01 18:02:20,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-01 18:02:20,884 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-01 18:02:20,884 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210
[2024-11-01 18:02:20,885 INFO  L87              Difference]: Start difference. First operand 15 states and 15 transitions. Second operand  has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-01 18:02:21,407 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-01 18:02:21,407 INFO  L93              Difference]: Finished difference Result 30 states and 33 transitions.
[2024-11-01 18:02:21,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-11-01 18:02:21,408 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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
[2024-11-01 18:02:21,408 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-01 18:02:21,409 INFO  L225             Difference]: With dead ends: 30
[2024-11-01 18:02:21,409 INFO  L226             Difference]: Without dead ends: 28
[2024-11-01 18:02:21,409 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552
[2024-11-01 18:02:21,410 INFO  L432           NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-01 18:02:21,410 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 19 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-01 18:02:21,411 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2024-11-01 18:02:21,418 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27.
[2024-11-01 18:02:21,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-01 18:02:21,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions.
[2024-11-01 18:02:21,419 INFO  L78                 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14
[2024-11-01 18:02:21,419 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-01 18:02:21,419 INFO  L471      AbstractCegarLoop]: Abstraction has 27 states and 27 transitions.
[2024-11-01 18:02:21,420 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-01 18:02:21,420 INFO  L276                IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions.
[2024-11-01 18:02:21,420 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-01 18:02:21,420 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-01 18:02:21,420 INFO  L215           NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1]
[2024-11-01 18:02:21,425 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2024-11-01 18:02:21,621 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-01 18:02:21,621 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-01 18:02:21,622 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-01 18:02:21,622 INFO  L85        PathProgramCache]: Analyzing trace with hash 96933411, now seen corresponding path program 3 times
[2024-11-01 18:02:21,622 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-01 18:02:21,622 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1834761409]
[2024-11-01 18:02:21,622 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-01 18:02:21,623 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-01 18:02:21,623 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-01 18:02:21,631 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-01 18:02:21,633 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-01 18:02:21,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-01 18:02:21,714 INFO  L255         TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 27 conjuncts are in the unsatisfiable core
[2024-11-01 18:02:21,719 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-01 18:02:22,727 INFO  L134       CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-01 18:02:22,728 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-01 18:02:30,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-01 18:02:30,294 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-01 18:02:30,294 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1834761409]
[2024-11-01 18:02:30,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [1834761409] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-01 18:02:30,295 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-01 18:02:30,295 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23
[2024-11-01 18:02:30,295 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9112034]
[2024-11-01 18:02:30,295 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-01 18:02:30,295 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2024-11-01 18:02:30,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-01 18:02:30,296 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2024-11-01 18:02:30,297 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=332, Unknown=0, NotChecked=0, Total=506
[2024-11-01 18:02:30,297 INFO  L87              Difference]: Start difference. First operand 27 states and 27 transitions. Second operand  has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-01 18:02:34,630 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-01 18:02:34,630 INFO  L93              Difference]: Finished difference Result 54 states and 61 transitions.
[2024-11-01 18:02:34,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. 
[2024-11-01 18:02:34,631 INFO  L78                 Accepts]: Start accepts. Automaton has  has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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 26
[2024-11-01 18:02:34,631 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-01 18:02:34,631 INFO  L225             Difference]: With dead ends: 54
[2024-11-01 18:02:34,631 INFO  L226             Difference]: Without dead ends: 52
[2024-11-01 18:02:34,632 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=690, Invalid=1202, Unknown=0, NotChecked=0, Total=1892
[2024-11-01 18:02:34,633 INFO  L432           NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-01 18:02:34,633 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 25 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-01 18:02:34,633 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2024-11-01 18:02:34,651 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51.
[2024-11-01 18:02:34,651 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-01 18:02:34,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions.
[2024-11-01 18:02:34,652 INFO  L78                 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26
[2024-11-01 18:02:34,652 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-01 18:02:34,652 INFO  L471      AbstractCegarLoop]: Abstraction has 51 states and 51 transitions.
[2024-11-01 18:02:34,653 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-01 18:02:34,653 INFO  L276                IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions.
[2024-11-01 18:02:34,653 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2024-11-01 18:02:34,653 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-01 18:02:34,653 INFO  L215           NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1]
[2024-11-01 18:02:34,658 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0
[2024-11-01 18:02:34,854 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-01 18:02:34,854 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-01 18:02:34,855 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-01 18:02:34,855 INFO  L85        PathProgramCache]: Analyzing trace with hash 2084907299, now seen corresponding path program 4 times
[2024-11-01 18:02:34,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-01 18:02:34,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1339159690]
[2024-11-01 18:02:34,855 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-01 18:02:34,856 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-01 18:02:34,856 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-01 18:02:34,858 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-01 18:02:34,859 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-11-01 18:02:35,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-01 18:02:35,005 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-01 18:02:35,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-01 18:02:35,175 INFO  L130   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace
[2024-11-01 18:02:35,175 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-01 18:02:35,176 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-01 18:02:35,187 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2024-11-01 18:02:35,377 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-01 18:02:35,381 INFO  L407         BasicCegarLoop]: Path program histogram: [4, 1]
[2024-11-01 18:02:35,422 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-01 18:02:35,424 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 06:02:35 BoogieIcfgContainer
[2024-11-01 18:02:35,425 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-01 18:02:35,425 INFO  L158              Benchmark]: Toolchain (without parser) took 18253.99ms. Allocated memory was 222.3MB in the beginning and 599.8MB in the end (delta: 377.5MB). Free memory was 196.9MB in the beginning and 542.8MB in the end (delta: -345.9MB). Peak memory consumption was 32.1MB. Max. memory is 8.0GB.
[2024-11-01 18:02:35,425 INFO  L158              Benchmark]: CDTParser took 0.13ms. Allocated memory is still 222.3MB. Free memory is still 198.4MB. There was no memory consumed. Max. memory is 8.0GB.
[2024-11-01 18:02:35,426 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 301.53ms. Allocated memory is still 222.3MB. Free memory was 196.4MB in the beginning and 183.3MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB.
[2024-11-01 18:02:35,426 INFO  L158              Benchmark]: Boogie Procedure Inliner took 41.40ms. Allocated memory is still 222.3MB. Free memory was 183.3MB in the beginning and 181.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2024-11-01 18:02:35,426 INFO  L158              Benchmark]: Boogie Preprocessor took 47.20ms. Allocated memory is still 222.3MB. Free memory was 181.7MB in the beginning and 179.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2024-11-01 18:02:35,426 INFO  L158              Benchmark]: RCFGBuilder took 289.14ms. Allocated memory is still 222.3MB. Free memory was 179.6MB in the beginning and 167.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
[2024-11-01 18:02:35,426 INFO  L158              Benchmark]: TraceAbstraction took 17566.85ms. Allocated memory was 222.3MB in the beginning and 599.8MB in the end (delta: 377.5MB). Free memory was 167.1MB in the beginning and 542.8MB in the end (delta: -375.8MB). Peak memory consumption was 2.8MB. Max. memory is 8.0GB.
[2024-11-01 18:02:35,429 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.13ms. Allocated memory is still 222.3MB. Free memory is still 198.4MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 301.53ms. Allocated memory is still 222.3MB. Free memory was 196.4MB in the beginning and 183.3MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 41.40ms. Allocated memory is still 222.3MB. Free memory was 183.3MB in the beginning and 181.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 47.20ms. Allocated memory is still 222.3MB. Free memory was 181.7MB in the beginning and 179.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 289.14ms. Allocated memory is still 222.3MB. Free memory was 179.6MB in the beginning and 167.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
 * TraceAbstraction took 17566.85ms. Allocated memory was 222.3MB in the beginning and 599.8MB in the end (delta: 377.5MB). Free memory was 167.1MB in the beginning and 542.8MB in the end (delta: -375.8MB). Peak memory consumption was 2.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
  - CounterExampleResult [Line: 22]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L27]              const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1);
[L28]              const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1);
[L30]              const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4);
[L31]              const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1);
[L33]              const SORT_4 var_5 = 0;
[L34]              const SORT_4 var_8 = 1;
[L35]              const SORT_4 var_13 = mask_SORT_4;
[L37]              SORT_1 input_2;
[L38]              SORT_1 input_3;
[L40]              SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4;
[L42]              SORT_4 init_7_arg_1 = var_5;
[L43]              state_6 = init_7_arg_1
       VAL         [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_13=15, var_5=0, var_8=1]
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND FALSE  !(!(cond))
[L56]  RET         __VERIFIER_assert(!(bad_15_arg_0))
[L58]              SORT_4 var_9_arg_0 = state_6;
[L59]              SORT_4 var_9_arg_1 = var_8;
[L60]              SORT_4 var_9 = var_9_arg_0 + var_9_arg_1;
[L61]              SORT_1 var_10_arg_0 = input_2;
[L62]              SORT_4 var_10_arg_1 = var_9;
[L63]              SORT_4 var_10_arg_2 = state_6;
[L64]              SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2;
[L65]              SORT_1 var_11_arg_0 = input_3;
[L66]              SORT_4 var_11_arg_1 = var_5;
[L67]              SORT_4 var_11_arg_2 = var_10;
[L68]              SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2;
[L69]              var_11 = var_11 & mask_SORT_4
[L70]              SORT_4 next_12_arg_1 = var_11;
[L72]              state_6 = next_12_arg_1
[L46]              input_2 = __VERIFIER_nondet_uchar()
[L47]              input_2 = input_2 & mask_SORT_1
[L48]              input_3 = __VERIFIER_nondet_uchar()
[L49]              input_3 = input_3 & mask_SORT_1
[L52]              SORT_4 var_14_arg_0 = state_6;
[L53]              SORT_4 var_14_arg_1 = var_13;
[L54]              SORT_1 var_14 = var_14_arg_0 == var_14_arg_1;
[L55]              SORT_1 bad_15_arg_0 = var_14;
[L56]  CALL        __VERIFIER_assert(!(bad_15_arg_0))
[L22]  COND TRUE   !(cond)
[L22]              reach_error()

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 134 IncrementalHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 16 mSDtfsCounter, 134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=4, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 25955 SizeOfPredicates, 41 NumberOfNonLiveVariables, 234 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/188 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 proved your program to be incorrect!
[2024-11-01 18:02:35,456 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...