/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 --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-51.i


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


This is Ultimate 0.2.5-dev-17387ad-m
[2024-11-06 00:02:11,822 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-06 00:02:11,889 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-06 00:02:11,897 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-06 00:02:11,899 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-06 00:02:11,930 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-06 00:02:11,930 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-06 00:02:11,930 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-06 00:02:11,931 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-06 00:02:11,934 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-06 00:02:11,934 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-06 00:02:11,934 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-06 00:02:11,935 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-06 00:02:11,935 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-06 00:02:11,935 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-06 00:02:11,936 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-06 00:02:11,936 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-06 00:02:11,936 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-06 00:02:11,937 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-06 00:02:11,939 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-06 00:02:11,942 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-06 00:02:11,942 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-06 00:02:11,942 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-06 00:02:11,943 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-06 00:02:11,943 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-06 00:02:11,943 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-06 00:02:11,943 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-06 00:02:11,944 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-06 00:02:11,944 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-06 00:02:11,944 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-06 00:02:11,944 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-06 00:02:11,945 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-06 00:02:11,945 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-06 00:02:11,945 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-06 00:02:11,947 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 00:02:11,947 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-06 00:02:11,947 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-06 00:02:11,947 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-06 00:02:11,947 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-06 00:02:11,947 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-06 00:02:11,948 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-06 00:02:11,948 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-06 00:02:11,948 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-06 00:02:11,948 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-06 00:02:11,949 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: Allow undefined functions -> true
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF
[2024-11-06 00:02:12,184 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-06 00:02:12,208 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-06 00:02:12,213 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-06 00:02:12,214 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-06 00:02:12,214 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-06 00:02:12,216 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-51.i
[2024-11-06 00:02:13,606 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-06 00:02:13,824 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-06 00:02:13,824 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-51.i
[2024-11-06 00:02:13,837 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32c42674/6b651a2da4174ecd8071210ddf824a9d/FLAG7c7fa8601
[2024-11-06 00:02:13,856 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32c42674/6b651a2da4174ecd8071210ddf824a9d
[2024-11-06 00:02:13,859 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-06 00:02:13,860 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-11-06 00:02:13,863 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-06 00:02:13,864 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-06 00:02:13,868 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-06 00:02:13,869 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:02:13" (1/1) ...
[2024-11-06 00:02:13,870 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359f0d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:13, skipping insertion in model container
[2024-11-06 00:02:13,870 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:02:13" (1/1) ...
[2024-11-06 00:02:13,902 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-06 00:02:14,077 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-51.i[915,928]
[2024-11-06 00:02:14,130 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-06 00:02:14,143 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-06 00:02:14,153 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-51.i[915,928]
[2024-11-06 00:02:14,195 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-06 00:02:14,219 INFO  L204         MainTranslator]: Completed translation
[2024-11-06 00:02:14,220 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:14 WrapperNode
[2024-11-06 00:02:14,220 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-06 00:02:14,221 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-06 00:02:14,221 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-06 00:02:14,221 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-06 00:02:14,227 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:14" (1/1) ...
[2024-11-06 00:02:14,236 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:14" (1/1) ...
[2024-11-06 00:02:14,264 INFO  L138                Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148
[2024-11-06 00:02:14,265 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-06 00:02:14,266 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-06 00:02:14,266 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-06 00:02:14,266 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-06 00:02:14,276 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:14" (1/1) ...
[2024-11-06 00:02:14,277 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:14" (1/1) ...
[2024-11-06 00:02:14,281 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:14" (1/1) ...
[2024-11-06 00:02:14,301 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-06 00:02:14,301 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:14" (1/1) ...
[2024-11-06 00:02:14,301 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:14" (1/1) ...
[2024-11-06 00:02:14,310 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:14" (1/1) ...
[2024-11-06 00:02:14,317 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:14" (1/1) ...
[2024-11-06 00:02:14,321 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:14" (1/1) ...
[2024-11-06 00:02:14,323 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:14" (1/1) ...
[2024-11-06 00:02:14,326 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-06 00:02:14,327 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-06 00:02:14,328 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-06 00:02:14,328 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-06 00:02:14,328 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:14" (1/1) ...
[2024-11-06 00:02:14,336 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 00:02:14,347 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 00:02:14,378 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-06 00:02:14,380 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-06 00:02:14,400 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-06 00:02:14,400 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-06 00:02:14,400 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-06 00:02:14,400 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-06 00:02:14,400 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-06 00:02:14,400 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-06 00:02:14,474 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-06 00:02:14,475 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-06 00:02:27,241 INFO  L?                        ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2024-11-06 00:02:27,241 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-06 00:02:27,255 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-06 00:02:27,255 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-06 00:02:27,255 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:02:27 BoogieIcfgContainer
[2024-11-06 00:02:27,256 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-06 00:02:27,259 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-06 00:02:27,259 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-06 00:02:27,262 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-06 00:02:27,263 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:02:13" (1/3) ...
[2024-11-06 00:02:27,263 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da6348d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:02:27, skipping insertion in model container
[2024-11-06 00:02:27,264 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:14" (2/3) ...
[2024-11-06 00:02:27,264 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da6348d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:02:27, skipping insertion in model container
[2024-11-06 00:02:27,264 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:02:27" (3/3) ...
[2024-11-06 00:02:27,265 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-51.i
[2024-11-06 00:02:27,278 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-06 00:02:27,278 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-06 00:02:27,331 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-06 00:02:27,337 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;@78336943, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-06 00:02:27,338 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-06 00:02:27,342 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2024-11-06 00:02:27,356 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2024-11-06 00:02:27,356 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:02:27,357 INFO  L215           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:02:27,357 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:02:27,362 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:02:27,363 INFO  L85        PathProgramCache]: Analyzing trace with hash -1740960990, now seen corresponding path program 1 times
[2024-11-06 00:02:27,379 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:02:27,380 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853489504]
[2024-11-06 00:02:27,380 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:02:27,381 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-06 00:02:27,381 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:02:27,385 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-06 00:02:27,387 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-06 00:02:28,259 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:02:28,288 INFO  L255         TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-06 00:02:28,299 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:02:28,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked.
[2024-11-06 00:02:28,353 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:02:28,354 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:02:28,354 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853489504]
[2024-11-06 00:02:28,354 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853489504] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:02:28,354 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:02:28,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 00:02:28,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943474225]
[2024-11-06 00:02:28,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:02:28,361 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-06 00:02:28,361 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:02:28,380 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-06 00:02:28,381 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-06 00:02:28,383 INFO  L87              Difference]: Start difference. First operand  has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21)
[2024-11-06 00:02:28,416 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:02:28,417 INFO  L93              Difference]: Finished difference Result 127 states and 219 transitions.
[2024-11-06 00:02:28,418 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-06 00:02:28,420 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135
[2024-11-06 00:02:28,420 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:02:28,430 INFO  L225             Difference]: With dead ends: 127
[2024-11-06 00:02:28,430 INFO  L226             Difference]: Without dead ends: 63
[2024-11-06 00:02:28,434 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-06 00:02:28,437 INFO  L432           NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-06 00:02:28,438 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-06 00:02:28,453 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2024-11-06 00:02:28,479 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2024-11-06 00:02:28,481 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 63 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2024-11-06 00:02:28,483 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions.
[2024-11-06 00:02:28,485 INFO  L78                 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 135
[2024-11-06 00:02:28,485 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:02:28,485 INFO  L471      AbstractCegarLoop]: Abstraction has 63 states and 95 transitions.
[2024-11-06 00:02:28,486 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21)
[2024-11-06 00:02:28,486 INFO  L276                IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions.
[2024-11-06 00:02:28,490 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2024-11-06 00:02:28,491 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:02:28,491 INFO  L215           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:02:28,516 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-06 00:02:28,692 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-06 00:02:28,692 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:02:28,693 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:02:28,694 INFO  L85        PathProgramCache]: Analyzing trace with hash -1440285028, now seen corresponding path program 1 times
[2024-11-06 00:02:28,695 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:02:28,695 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335885130]
[2024-11-06 00:02:28,695 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:02:28,695 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-06 00:02:28,696 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:02:28,701 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-06 00:02:28,702 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-06 00:02:29,460 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:02:29,483 INFO  L255         TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-06 00:02:29,490 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:02:32,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2024-11-06 00:02:32,492 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:02:32,492 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:02:32,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335885130]
[2024-11-06 00:02:32,492 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [335885130] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:02:32,492 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:02:32,493 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 00:02:32,493 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959945330]
[2024-11-06 00:02:32,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:02:32,494 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-06 00:02:32,494 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:02:32,495 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-06 00:02:32,495 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-06 00:02:32,496 INFO  L87              Difference]: Start difference. First operand 63 states and 95 transitions. Second operand  has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2024-11-06 00:02:36,964 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:02:41,372 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:02:45,380 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:02:49,774 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:02:54,077 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:02:58,086 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:02:58,087 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:02:58,089 INFO  L93              Difference]: Finished difference Result 184 states and 280 transitions.
[2024-11-06 00:02:58,211 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-06 00:02:58,211 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135
[2024-11-06 00:02:58,212 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:02:58,214 INFO  L225             Difference]: With dead ends: 184
[2024-11-06 00:02:58,214 INFO  L226             Difference]: Without dead ends: 124
[2024-11-06 00:02:58,215 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-06 00:02:58,216 INFO  L432           NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 43 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time
[2024-11-06 00:02:58,217 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 262 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 25.5s Time]
[2024-11-06 00:02:58,219 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2024-11-06 00:02:58,241 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103.
[2024-11-06 00:02:58,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42)
[2024-11-06 00:02:58,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions.
[2024-11-06 00:02:58,244 INFO  L78                 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 135
[2024-11-06 00:02:58,245 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:02:58,245 INFO  L471      AbstractCegarLoop]: Abstraction has 103 states and 155 transitions.
[2024-11-06 00:02:58,245 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2024-11-06 00:02:58,245 INFO  L276                IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions.
[2024-11-06 00:02:58,247 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2024-11-06 00:02:58,247 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:02:58,248 INFO  L215           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:02:58,272 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 (3)] Forceful destruction successful, exit code 0
[2024-11-06 00:02:58,448 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-06 00:02:58,449 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:02:58,449 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:02:58,450 INFO  L85        PathProgramCache]: Analyzing trace with hash -810717471, now seen corresponding path program 1 times
[2024-11-06 00:02:58,450 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:02:58,450 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475579962]
[2024-11-06 00:02:58,450 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:02:58,451 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-06 00:02:58,451 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:02:58,453 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-06 00:02:58,454 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-06 00:02:59,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:02:59,240 INFO  L255         TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-06 00:02:59,244 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:03:02,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2024-11-06 00:03:02,551 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:03:02,552 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:03:02,552 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475579962]
[2024-11-06 00:03:02,552 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475579962] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:03:02,552 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:03:02,552 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-06 00:03:02,553 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141056081]
[2024-11-06 00:03:02,553 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:03:02,554 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-06 00:03:02,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:03:02,555 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-06 00:03:02,555 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-06 00:03:02,555 INFO  L87              Difference]: Start difference. First operand 103 states and 155 transitions. Second operand  has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2024-11-06 00:03:07,978 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:03:11,982 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:03:15,986 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:03:20,320 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:03:24,338 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:03:28,757 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:03:32,767 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:03:34,109 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:03:34,110 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:03:34,110 INFO  L93              Difference]: Finished difference Result 230 states and 346 transitions.
[2024-11-06 00:03:34,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-06 00:03:34,236 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136
[2024-11-06 00:03:34,237 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:03:34,239 INFO  L225             Difference]: With dead ends: 230
[2024-11-06 00:03:34,239 INFO  L226             Difference]: Without dead ends: 170
[2024-11-06 00:03:34,240 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-06 00:03:34,243 INFO  L432           NwaCegarLoop]: 96 mSDtfsCounter, 78 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 43 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.3s IncrementalHoareTripleChecker+Time
[2024-11-06 00:03:34,244 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 319 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 65 Invalid, 7 Unknown, 0 Unchecked, 31.3s Time]
[2024-11-06 00:03:34,245 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 170 states.
[2024-11-06 00:03:34,273 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161.
[2024-11-06 00:03:34,274 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 161 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63)
[2024-11-06 00:03:34,275 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 245 transitions.
[2024-11-06 00:03:34,276 INFO  L78                 Accepts]: Start accepts. Automaton has 161 states and 245 transitions. Word has length 136
[2024-11-06 00:03:34,276 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:03:34,277 INFO  L471      AbstractCegarLoop]: Abstraction has 161 states and 245 transitions.
[2024-11-06 00:03:34,277 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2024-11-06 00:03:34,277 INFO  L276                IsEmpty]: Start isEmpty. Operand 161 states and 245 transitions.
[2024-11-06 00:03:34,280 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2024-11-06 00:03:34,280 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:03:34,281 INFO  L215           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:03:34,311 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 (4)] Ended with exit code 0
[2024-11-06 00:03:34,481 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-06 00:03:34,482 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:03:34,483 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:03:34,483 INFO  L85        PathProgramCache]: Analyzing trace with hash 1205819797, now seen corresponding path program 1 times
[2024-11-06 00:03:34,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:03:34,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936472691]
[2024-11-06 00:03:34,484 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:03:34,484 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-06 00:03:34,484 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:03:34,487 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-06 00:03:34,488 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-06 00:03:35,219 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:03:35,250 INFO  L255         TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-06 00:03:35,255 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:03:35,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2024-11-06 00:03:35,376 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:03:35,377 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:03:35,377 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936472691]
[2024-11-06 00:03:35,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936472691] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:03:35,377 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:03:35,377 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 00:03:35,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109713715]
[2024-11-06 00:03:35,377 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:03:35,378 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 00:03:35,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:03:35,379 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 00:03:35,379 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 00:03:35,379 INFO  L87              Difference]: Start difference. First operand 161 states and 245 transitions. Second operand  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2024-11-06 00:03:39,772 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:03:44,174 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:03:48,189 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:03:48,190 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:03:48,190 INFO  L93              Difference]: Finished difference Result 289 states and 444 transitions.
[2024-11-06 00:03:48,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-06 00:03:48,295 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137
[2024-11-06 00:03:48,296 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:03:48,298 INFO  L225             Difference]: With dead ends: 289
[2024-11-06 00:03:48,298 INFO  L226             Difference]: Without dead ends: 171
[2024-11-06 00:03:48,299 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 00:03:48,300 INFO  L432           NwaCegarLoop]: 107 mSDtfsCounter, 17 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time
[2024-11-06 00:03:48,301 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 193 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 3 Unknown, 0 Unchecked, 12.8s Time]
[2024-11-06 00:03:48,302 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2024-11-06 00:03:48,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 161.
[2024-11-06 00:03:48,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 161 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 94 states have internal predecessors, (117), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63)
[2024-11-06 00:03:48,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 243 transitions.
[2024-11-06 00:03:48,330 INFO  L78                 Accepts]: Start accepts. Automaton has 161 states and 243 transitions. Word has length 137
[2024-11-06 00:03:48,331 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:03:48,331 INFO  L471      AbstractCegarLoop]: Abstraction has 161 states and 243 transitions.
[2024-11-06 00:03:48,331 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)
[2024-11-06 00:03:48,331 INFO  L276                IsEmpty]: Start isEmpty. Operand 161 states and 243 transitions.
[2024-11-06 00:03:48,333 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-06 00:03:48,333 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:03:48,333 INFO  L215           NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:03:48,358 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 (5)] Forceful destruction successful, exit code 0
[2024-11-06 00:03:48,537 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-06 00:03:48,538 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:03:48,539 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:03:48,539 INFO  L85        PathProgramCache]: Analyzing trace with hash 463284182, now seen corresponding path program 1 times
[2024-11-06 00:03:48,539 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:03:48,539 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587491671]
[2024-11-06 00:03:48,539 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:03:48,540 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-06 00:03:48,540 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:03:48,541 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-06 00:03:48,542 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-06 00:03:49,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:03:49,387 INFO  L255         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-06 00:03:49,390 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:03:51,746 INFO  L134       CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked.
[2024-11-06 00:03:51,746 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-06 00:03:52,284 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:03:52,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587491671]
[2024-11-06 00:03:52,284 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [587491671] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-06 00:03:52,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1768878144]
[2024-11-06 00:03:52,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:03:52,285 INFO  L173          SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-06 00:03:52,285 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4
[2024-11-06 00:03:52,310 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-06 00:03:52,311 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process
[2024-11-06 00:03:54,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:03:54,092 INFO  L255         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-06 00:03:54,097 INFO  L278         TraceCheckSpWp]: Computing forward predicates...