/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_amount250_file-0.i


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


This is Ultimate 0.2.5-dev-17387ad-m
[2024-11-05 23:19:16,275 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-05 23:19:16,335 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-05 23:19:16,341 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-05 23:19:16,341 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-05 23:19:16,367 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-05 23:19:16,367 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-05 23:19:16,367 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-05 23:19:16,368 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-05 23:19:16,368 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-05 23:19:16,368 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-05 23:19:16,368 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-05 23:19:16,369 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-05 23:19:16,370 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-05 23:19:16,371 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-05 23:19:16,371 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-05 23:19:16,372 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-05 23:19:16,374 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-05 23:19:16,374 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-05 23:19:16,374 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-05 23:19:16,375 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-05 23:19:16,375 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-05 23:19:16,375 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-05 23:19:16,375 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-05 23:19:16,375 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-05 23:19:16,375 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-05 23:19:16,376 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-05 23:19:16,377 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-05 23:19:16,377 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-05 23:19:16,377 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-05 23:19:16,378 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-05 23:19:16,378 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-05 23:19:16,378 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-05 23:19:16,378 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-05 23:19:16,378 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-05 23:19:16,378 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-05 23:19:16,379 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-05 23:19:16,379 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-05 23:19:16,379 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-05 23:19:16,379 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-05 23:19:16,379 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-05 23:19:16,379 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-05 23:19:16,380 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-05 23:19:16,380 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-05 23:19:16,380 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-05 23:19:16,565 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-05 23:19:16,587 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-05 23:19:16,589 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-05 23:19:16,589 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-05 23:19:16,590 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-05 23:19:16,591 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-0.i
[2024-11-05 23:19:17,863 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-05 23:19:18,056 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-05 23:19:18,057 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-0.i
[2024-11-05 23:19:18,066 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31a76500/81b8b8c3397e4b62b1ab28ebcf3bdc79/FLAG4bb66bc15
[2024-11-05 23:19:18,430 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31a76500/81b8b8c3397e4b62b1ab28ebcf3bdc79
[2024-11-05 23:19:18,432 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-05 23:19:18,433 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-11-05 23:19:18,434 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-05 23:19:18,434 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-05 23:19:18,439 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-05 23:19:18,440 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:19:18" (1/1) ...
[2024-11-05 23:19:18,441 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e03d528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18, skipping insertion in model container
[2024-11-05 23:19:18,441 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:19:18" (1/1) ...
[2024-11-05 23:19:18,472 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-05 23:19:18,600 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_amount250_file-0.i[915,928]
[2024-11-05 23:19:18,719 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-05 23:19:18,736 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-05 23:19:18,745 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_amount250_file-0.i[915,928]
[2024-11-05 23:19:18,795 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-05 23:19:18,811 INFO  L204         MainTranslator]: Completed translation
[2024-11-05 23:19:18,811 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18 WrapperNode
[2024-11-05 23:19:18,811 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-05 23:19:18,812 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-05 23:19:18,812 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-05 23:19:18,812 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-05 23:19:18,817 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18" (1/1) ...
[2024-11-05 23:19:18,829 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18" (1/1) ...
[2024-11-05 23:19:18,857 INFO  L138                Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 288
[2024-11-05 23:19:18,857 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-05 23:19:18,858 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-05 23:19:18,858 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-05 23:19:18,858 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-05 23:19:18,866 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18" (1/1) ...
[2024-11-05 23:19:18,866 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18" (1/1) ...
[2024-11-05 23:19:18,870 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18" (1/1) ...
[2024-11-05 23:19:18,889 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-05 23:19:18,890 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18" (1/1) ...
[2024-11-05 23:19:18,890 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18" (1/1) ...
[2024-11-05 23:19:18,905 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18" (1/1) ...
[2024-11-05 23:19:18,909 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18" (1/1) ...
[2024-11-05 23:19:18,911 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18" (1/1) ...
[2024-11-05 23:19:18,917 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18" (1/1) ...
[2024-11-05 23:19:18,925 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-05 23:19:18,926 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-05 23:19:18,926 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-05 23:19:18,926 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-05 23:19:18,927 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18" (1/1) ...
[2024-11-05 23:19:18,932 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-05 23:19:18,942 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-05 23:19:18,956 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-05 23:19:18,958 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-05 23:19:18,980 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-05 23:19:18,980 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-05 23:19:18,980 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-05 23:19:18,980 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-05 23:19:18,980 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-05 23:19:18,981 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-05 23:19:19,071 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-05 23:19:19,072 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-05 23:19:39,257 INFO  L?                        ?]: Removed 30 outVars from TransFormulas that were not future-live.
[2024-11-05 23:19:39,258 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-05 23:19:39,268 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-05 23:19:39,268 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-05 23:19:39,269 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:19:39 BoogieIcfgContainer
[2024-11-05 23:19:39,269 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-05 23:19:39,270 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-05 23:19:39,271 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-05 23:19:39,274 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-05 23:19:39,274 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 11:19:18" (1/3) ...
[2024-11-05 23:19:39,275 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1262222b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:19:39, skipping insertion in model container
[2024-11-05 23:19:39,275 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:19:18" (2/3) ...
[2024-11-05 23:19:39,275 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1262222b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:19:39, skipping insertion in model container
[2024-11-05 23:19:39,275 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:19:39" (3/3) ...
[2024-11-05 23:19:39,277 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-0.i
[2024-11-05 23:19:39,291 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-05 23:19:39,291 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-05 23:19:39,348 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-05 23:19:39,352 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;@b69cd7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-05 23:19:39,353 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-05 23:19:39,359 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 125 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 91 states have internal predecessors, (139), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-05 23:19:39,375 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 223
[2024-11-05 23:19:39,375 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 23:19:39,377 INFO  L215           NwaCegarLoop]: trace histogram [32, 32, 32, 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, 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-05 23:19:39,377 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 23:19:39,381 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 23:19:39,381 INFO  L85        PathProgramCache]: Analyzing trace with hash -1129801030, now seen corresponding path program 1 times
[2024-11-05 23:19:39,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-05 23:19:39,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366931146]
[2024-11-05 23:19:39,393 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 23:19:39,393 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-05 23:19:39,393 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 23:19:39,399 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-05 23:19:39,400 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-05 23:19:40,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 23:19:40,429 INFO  L255         TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-05 23:19:40,440 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 23:19:40,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 1082 trivial. 0 not checked.
[2024-11-05 23:19:40,495 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-05 23:19:40,495 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-05 23:19:40,496 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366931146]
[2024-11-05 23:19:40,496 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366931146] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-05 23:19:40,496 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-05 23:19:40,496 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-05 23:19:40,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77830959]
[2024-11-05 23:19:40,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-05 23:19:40,502 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-05 23:19:40,503 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-05 23:19:40,518 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-05 23:19:40,518 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-05 23:19:40,520 INFO  L87              Difference]: Start difference. First operand  has 125 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 91 states have internal predecessors, (139), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand  has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32)
[2024-11-05 23:19:40,555 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 23:19:40,555 INFO  L93              Difference]: Finished difference Result 243 states and 432 transitions.
[2024-11-05 23:19:40,556 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-05 23:19:40,557 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 222
[2024-11-05 23:19:40,557 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 23:19:40,564 INFO  L225             Difference]: With dead ends: 243
[2024-11-05 23:19:40,564 INFO  L226             Difference]: Without dead ends: 121
[2024-11-05 23:19:40,570 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 221 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-05 23:19:40,573 INFO  L432           NwaCegarLoop]: 196 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, 196 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-05 23:19:40,575 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-05 23:19:40,589 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2024-11-05 23:19:40,615 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121.
[2024-11-05 23:19:40,616 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 121 states, 87 states have (on average 1.5172413793103448) internal successors, (132), 87 states have internal predecessors, (132), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-05 23:19:40,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 196 transitions.
[2024-11-05 23:19:40,622 INFO  L78                 Accepts]: Start accepts. Automaton has 121 states and 196 transitions. Word has length 222
[2024-11-05 23:19:40,622 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 23:19:40,623 INFO  L471      AbstractCegarLoop]: Abstraction has 121 states and 196 transitions.
[2024-11-05 23:19:40,623 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32)
[2024-11-05 23:19:40,623 INFO  L276                IsEmpty]: Start isEmpty. Operand 121 states and 196 transitions.
[2024-11-05 23:19:40,629 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 223
[2024-11-05 23:19:40,629 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 23:19:40,629 INFO  L215           NwaCegarLoop]: trace histogram [32, 32, 32, 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, 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-05 23:19:40,669 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 (2)] Forceful destruction successful, exit code 0
[2024-11-05 23:19:40,830 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-05 23:19:40,831 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 23:19:40,831 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 23:19:40,831 INFO  L85        PathProgramCache]: Analyzing trace with hash -1581236474, now seen corresponding path program 1 times
[2024-11-05 23:19:40,832 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-05 23:19:40,832 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848990389]
[2024-11-05 23:19:40,832 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 23:19:40,832 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-05 23:19:40,833 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 23:19:40,837 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-05 23:19:40,839 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-05 23:19:41,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 23:19:41,886 INFO  L255         TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-05 23:19:41,892 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 23:19:45,701 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 783 proven. 69 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked.
[2024-11-05 23:19:45,701 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-05 23:19:49,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked.
[2024-11-05 23:19:49,058 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-05 23:19:49,058 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848990389]
[2024-11-05 23:19:49,059 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848990389] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-05 23:19:49,059 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-05 23:19:49,059 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7
[2024-11-05 23:19:49,059 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871373982]
[2024-11-05 23:19:49,059 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-05 23:19:49,062 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-05 23:19:49,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-05 23:19:49,063 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-05 23:19:49,063 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-05 23:19:49,064 INFO  L87              Difference]: Start difference. First operand 121 states and 196 transitions. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56)
[2024-11-05 23:19:56,569 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-05 23:20:00,577 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-05 23:20:04,594 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-05 23:20:04,597 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 23:20:04,597 INFO  L93              Difference]: Finished difference Result 245 states and 394 transitions.
[2024-11-05 23:20:04,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-05 23:20:04,724 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 222
[2024-11-05 23:20:04,725 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 23:20:04,727 INFO  L225             Difference]: With dead ends: 245
[2024-11-05 23:20:04,727 INFO  L226             Difference]: Without dead ends: 127
[2024-11-05 23:20:04,728 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 436 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90
[2024-11-05 23:20:04,729 INFO  L432           NwaCegarLoop]: 148 mSDtfsCounter, 117 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 13 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time
[2024-11-05 23:20:04,729 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 378 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 192 Invalid, 3 Unknown, 0 Unchecked, 15.2s Time]
[2024-11-05 23:20:04,730 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2024-11-05 23:20:04,741 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125.
[2024-11-05 23:20:04,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 125 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 90 states have internal predecessors, (131), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-05 23:20:04,742 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 195 transitions.
[2024-11-05 23:20:04,743 INFO  L78                 Accepts]: Start accepts. Automaton has 125 states and 195 transitions. Word has length 222
[2024-11-05 23:20:04,743 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 23:20:04,743 INFO  L471      AbstractCegarLoop]: Abstraction has 125 states and 195 transitions.
[2024-11-05 23:20:04,744 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56)
[2024-11-05 23:20:04,744 INFO  L276                IsEmpty]: Start isEmpty. Operand 125 states and 195 transitions.
[2024-11-05 23:20:04,746 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 224
[2024-11-05 23:20:04,747 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 23:20:04,747 INFO  L215           NwaCegarLoop]: trace histogram [32, 32, 32, 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, 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-05 23:20:04,785 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-05 23:20:04,947 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-05 23:20:04,948 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 23:20:04,948 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 23:20:04,949 INFO  L85        PathProgramCache]: Analyzing trace with hash -442019509, now seen corresponding path program 1 times
[2024-11-05 23:20:04,949 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-05 23:20:04,949 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715712390]
[2024-11-05 23:20:04,949 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 23:20:04,950 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-05 23:20:04,950 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 23:20:04,951 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-05 23:20:04,953 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-05 23:20:06,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 23:20:06,071 INFO  L255         TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-05 23:20:06,079 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 23:20:10,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 891 proven. 63 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked.
[2024-11-05 23:20:10,171 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-05 23:20:14,120 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 30 proven. 63 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked.
[2024-11-05 23:20:14,120 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-05 23:20:14,120 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715712390]
[2024-11-05 23:20:14,121 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [715712390] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-05 23:20:14,121 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-05 23:20:14,121 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7
[2024-11-05 23:20:14,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042222378]
[2024-11-05 23:20:14,121 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-05 23:20:14,121 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-05 23:20:14,122 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-05 23:20:14,124 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-05 23:20:14,124 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-05 23:20:14,125 INFO  L87              Difference]: Start difference. First operand 125 states and 195 transitions. Second operand  has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54)
[2024-11-05 23:20:22,065 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-05 23:20:26,070 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-05 23:20:30,072 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-05 23:20:31,138 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 23:20:31,139 INFO  L93              Difference]: Finished difference Result 277 states and 425 transitions.
[2024-11-05 23:20:31,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-05 23:20:31,140 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 223
[2024-11-05 23:20:31,140 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 23:20:31,142 INFO  L225             Difference]: With dead ends: 277
[2024-11-05 23:20:31,142 INFO  L226             Difference]: Without dead ends: 155
[2024-11-05 23:20:31,143 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 438 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90
[2024-11-05 23:20:31,143 INFO  L432           NwaCegarLoop]: 168 mSDtfsCounter, 311 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 51 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time
[2024-11-05 23:20:31,144 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 412 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 242 Invalid, 3 Unknown, 0 Unchecked, 16.6s Time]
[2024-11-05 23:20:31,144 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 155 states.
[2024-11-05 23:20:31,155 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152.
[2024-11-05 23:20:31,155 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 152 states, 105 states have (on average 1.361904761904762) internal successors, (143), 106 states have internal predecessors, (143), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42)
[2024-11-05 23:20:31,156 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions.
[2024-11-05 23:20:31,157 INFO  L78                 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 223
[2024-11-05 23:20:31,157 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 23:20:31,157 INFO  L471      AbstractCegarLoop]: Abstraction has 152 states and 227 transitions.
[2024-11-05 23:20:31,157 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54)
[2024-11-05 23:20:31,158 INFO  L276                IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions.
[2024-11-05 23:20:31,161 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2024-11-05 23:20:31,161 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 23:20:31,162 INFO  L215           NwaCegarLoop]: trace histogram [32, 32, 32, 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, 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-05 23:20:31,196 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-05 23:20:31,362 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-05 23:20:31,363 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 23:20:31,363 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 23:20:31,363 INFO  L85        PathProgramCache]: Analyzing trace with hash -539589803, now seen corresponding path program 1 times
[2024-11-05 23:20:31,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-05 23:20:31,364 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455989814]
[2024-11-05 23:20:31,364 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 23:20:31,364 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-05 23:20:31,364 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 23:20:31,367 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-05 23:20:31,367 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-05 23:20:32,437 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 23:20:32,491 INFO  L255         TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-05 23:20:32,496 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 23:20:36,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 993 proven. 54 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked.
[2024-11-05 23:20:36,209 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-05 23:20:40,153 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 39 proven. 54 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked.
[2024-11-05 23:20:40,154 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-05 23:20:40,154 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455989814]
[2024-11-05 23:20:40,154 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455989814] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-05 23:20:40,154 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-05 23:20:40,154 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7
[2024-11-05 23:20:40,154 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53299375]
[2024-11-05 23:20:40,155 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-05 23:20:40,155 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-05 23:20:40,155 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-05 23:20:40,156 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-05 23:20:40,156 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-05 23:20:40,158 INFO  L87              Difference]: Start difference. First operand 152 states and 227 transitions. Second operand  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51)
[2024-11-05 23:20:48,623 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-05 23:20:52,632 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-05 23:20:56,640 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-05 23:20:56,643 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 23:20:56,643 INFO  L93              Difference]: Finished difference Result 286 states and 426 transitions.
[2024-11-05 23:20:56,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-05 23:20:56,802 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 224
[2024-11-05 23:20:56,803 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 23:20:56,805 INFO  L225             Difference]: With dead ends: 286
[2024-11-05 23:20:56,805 INFO  L226             Difference]: Without dead ends: 160
[2024-11-05 23:20:56,806 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 440 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110
[2024-11-05 23:20:56,807 INFO  L432           NwaCegarLoop]: 142 mSDtfsCounter, 112 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time
[2024-11-05 23:20:56,807 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 360 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 206 Invalid, 3 Unknown, 0 Unchecked, 16.0s Time]
[2024-11-05 23:20:56,808 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2024-11-05 23:20:56,818 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156.
[2024-11-05 23:20:56,818 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 156 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 109 states have internal predecessors, (144), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42)
[2024-11-05 23:20:56,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 228 transitions.
[2024-11-05 23:20:56,820 INFO  L78                 Accepts]: Start accepts. Automaton has 156 states and 228 transitions. Word has length 224
[2024-11-05 23:20:56,820 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 23:20:56,820 INFO  L471      AbstractCegarLoop]: Abstraction has 156 states and 228 transitions.
[2024-11-05 23:20:56,821 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51)
[2024-11-05 23:20:56,821 INFO  L276                IsEmpty]: Start isEmpty. Operand 156 states and 228 transitions.
[2024-11-05 23:20:56,822 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2024-11-05 23:20:56,822 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 23:20:56,823 INFO  L215           NwaCegarLoop]: trace histogram [32, 32, 32, 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, 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-05 23:20:56,857 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-05 23:20:57,026 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-05 23:20:57,027 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 23:20:57,027 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 23:20:57,027 INFO  L85        PathProgramCache]: Analyzing trace with hash 162010071, now seen corresponding path program 1 times
[2024-11-05 23:20:57,028 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-05 23:20:57,028 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882726274]
[2024-11-05 23:20:57,028 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 23:20:57,028 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-05 23:20:57,028 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 23:20:57,029 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-05 23:20:57,030 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-05 23:20:58,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 23:20:58,522 INFO  L255         TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-05 23:20:58,525 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 23:21:03,009 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 517 proven. 12 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked.
[2024-11-05 23:21:03,009 INFO  L311         TraceCheckSpWp]: Computing backward predicates...