/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-11.i


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


This is Ultimate 0.2.5-dev-17387ad-m
[2024-11-05 23:57:03,943 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-05 23:57:04,013 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:57:04,018 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-05 23:57:04,019 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-05 23:57:04,047 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-05 23:57:04,048 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-05 23:57:04,048 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-05 23:57:04,048 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-05 23:57:04,049 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-05 23:57:04,049 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-05 23:57:04,049 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-05 23:57:04,050 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-05 23:57:04,051 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-05 23:57:04,052 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-05 23:57:04,052 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-05 23:57:04,052 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-05 23:57:04,052 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-05 23:57:04,053 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-05 23:57:04,053 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-05 23:57:04,053 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-05 23:57:04,057 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-05 23:57:04,057 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-05 23:57:04,057 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-05 23:57:04,057 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-05 23:57:04,058 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-05 23:57:04,058 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-05 23:57:04,058 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-05 23:57:04,058 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-05 23:57:04,058 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-05 23:57:04,059 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-05 23:57:04,059 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-05 23:57:04,059 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-05 23:57:04,059 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-05 23:57:04,059 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-05 23:57:04,059 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-05 23:57:04,060 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-05 23:57:04,060 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-05 23:57:04,060 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-05 23:57:04,061 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-05 23:57:04,061 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-05 23:57:04,062 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-05 23:57:04,062 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-05 23:57:04,062 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-05 23:57:04,062 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:57:04,260 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-05 23:57:04,279 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-05 23:57:04,281 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-05 23:57:04,282 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-05 23:57:04,283 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-05 23:57:04,284 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-11.i
[2024-11-05 23:57:05,630 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-05 23:57:05,786 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-05 23:57:05,786 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-11.i
[2024-11-05 23:57:05,793 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41fa6630/2f06a5c9614246dc86e1c399713e9c73/FLAG62cd12338
[2024-11-05 23:57:06,190 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41fa6630/2f06a5c9614246dc86e1c399713e9c73
[2024-11-05 23:57:06,193 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-05 23:57:06,194 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-11-05 23:57:06,195 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-05 23:57:06,195 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-05 23:57:06,200 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-05 23:57:06,201 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:57:06" (1/1) ...
[2024-11-05 23:57:06,202 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8764bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:57:06, skipping insertion in model container
[2024-11-05 23:57:06,202 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:57:06" (1/1) ...
[2024-11-05 23:57:06,231 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-05 23:57:06,380 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-11.i[915,928]
[2024-11-05 23:57:06,428 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-05 23:57:06,444 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-05 23:57:06,453 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-11.i[915,928]
[2024-11-05 23:57:06,481 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-05 23:57:06,500 INFO  L204         MainTranslator]: Completed translation
[2024-11-05 23:57:06,501 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:57:06 WrapperNode
[2024-11-05 23:57:06,501 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-05 23:57:06,502 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-05 23:57:06,502 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-05 23:57:06,502 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-05 23:57:06,508 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:57:06" (1/1) ...
[2024-11-05 23:57:06,519 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:57:06" (1/1) ...
[2024-11-05 23:57:06,543 INFO  L138                Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127
[2024-11-05 23:57:06,544 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-05 23:57:06,545 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-05 23:57:06,545 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-05 23:57:06,545 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-05 23:57:06,555 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:57:06" (1/1) ...
[2024-11-05 23:57:06,555 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:57:06" (1/1) ...
[2024-11-05 23:57:06,559 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:57:06" (1/1) ...
[2024-11-05 23:57:06,574 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:57:06,574 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:57:06" (1/1) ...
[2024-11-05 23:57:06,574 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:57:06" (1/1) ...
[2024-11-05 23:57:06,582 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:57:06" (1/1) ...
[2024-11-05 23:57:06,586 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:57:06" (1/1) ...
[2024-11-05 23:57:06,588 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:57:06" (1/1) ...
[2024-11-05 23:57:06,590 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:57:06" (1/1) ...
[2024-11-05 23:57:06,593 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-05 23:57:06,594 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-05 23:57:06,594 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-05 23:57:06,594 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-05 23:57:06,595 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:57:06" (1/1) ...
[2024-11-05 23:57:06,600 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-05 23:57:06,616 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-05 23:57:06,637 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:57:06,641 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:57:06,663 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-05 23:57:06,663 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-05 23:57:06,664 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-05 23:57:06,664 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-05 23:57:06,664 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-05 23:57:06,665 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-05 23:57:06,739 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-05 23:57:06,742 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-05 23:57:07,059 INFO  L?                        ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2024-11-05 23:57:07,059 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-05 23:57:07,095 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-05 23:57:07,095 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-05 23:57:07,096 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:57:07 BoogieIcfgContainer
[2024-11-05 23:57:07,096 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-05 23:57:07,100 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-05 23:57:07,100 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-05 23:57:07,105 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-05 23:57:07,105 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 11:57:06" (1/3) ...
[2024-11-05 23:57:07,107 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507bf0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:57:07, skipping insertion in model container
[2024-11-05 23:57:07,107 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:57:06" (2/3) ...
[2024-11-05 23:57:07,108 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507bf0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:57:07, skipping insertion in model container
[2024-11-05 23:57:07,108 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:57:07" (3/3) ...
[2024-11-05 23:57:07,109 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-11.i
[2024-11-05 23:57:07,126 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-05 23:57:07,126 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-05 23:57:07,197 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-05 23:57:07,201 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;@ef0a44e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-05 23:57:07,202 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-05 23:57:07,205 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 57 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17)
[2024-11-05 23:57:07,213 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2024-11-05 23:57:07,213 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 23:57:07,214 INFO  L215           NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:07,214 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 23:57:07,217 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 23:57:07,218 INFO  L85        PathProgramCache]: Analyzing trace with hash -1360217714, now seen corresponding path program 1 times
[2024-11-05 23:57:07,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-05 23:57:07,227 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406859879]
[2024-11-05 23:57:07,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 23:57:07,228 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:57:07,228 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 23:57:07,230 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:57:07,231 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:57:07,381 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 23:57:07,391 INFO  L255         TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-05 23:57:07,405 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 23:57:07,454 INFO  L134       CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked.
[2024-11-05 23:57:07,454 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-05 23:57:07,455 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-05 23:57:07,456 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406859879]
[2024-11-05 23:57:07,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406859879] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-05 23:57:07,457 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-05 23:57:07,457 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-05 23:57:07,459 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940409801]
[2024-11-05 23:57:07,459 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-05 23:57:07,463 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-05 23:57:07,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-05 23:57:07,483 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-05 23:57:07,484 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-05 23:57:07,486 INFO  L87              Difference]: Start difference. First operand  has 57 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand  has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17)
[2024-11-05 23:57:07,511 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 23:57:07,512 INFO  L93              Difference]: Finished difference Result 107 states and 183 transitions.
[2024-11-05 23:57:07,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-05 23:57:07,514 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110
[2024-11-05 23:57:07,514 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 23:57:07,520 INFO  L225             Difference]: With dead ends: 107
[2024-11-05 23:57:07,520 INFO  L226             Difference]: Without dead ends: 53
[2024-11-05 23:57:07,524 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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:57:07,528 INFO  L432           NwaCegarLoop]: 78 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, 78 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:57:07,529 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-05 23:57:07,543 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2024-11-05 23:57:07,567 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53.
[2024-11-05 23:57:07,568 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17)
[2024-11-05 23:57:07,571 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 78 transitions.
[2024-11-05 23:57:07,572 INFO  L78                 Accepts]: Start accepts. Automaton has 53 states and 78 transitions. Word has length 110
[2024-11-05 23:57:07,572 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 23:57:07,573 INFO  L471      AbstractCegarLoop]: Abstraction has 53 states and 78 transitions.
[2024-11-05 23:57:07,573 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17)
[2024-11-05 23:57:07,575 INFO  L276                IsEmpty]: Start isEmpty. Operand 53 states and 78 transitions.
[2024-11-05 23:57:07,578 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2024-11-05 23:57:07,578 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 23:57:07,579 INFO  L215           NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:07,585 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-05 23:57:07,784 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:57:07,785 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 23:57:07,785 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 23:57:07,785 INFO  L85        PathProgramCache]: Analyzing trace with hash -1522037806, now seen corresponding path program 1 times
[2024-11-05 23:57:07,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-05 23:57:07,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978803093]
[2024-11-05 23:57:07,786 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 23:57:07,787 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:57:07,787 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 23:57:07,795 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:57:07,796 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:57:07,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 23:57:07,912 INFO  L255         TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-05 23:57:07,918 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 23:57:08,581 INFO  L134       CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked.
[2024-11-05 23:57:08,581 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-05 23:57:08,581 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-05 23:57:08,581 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978803093]
[2024-11-05 23:57:08,582 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [978803093] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-05 23:57:08,582 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-05 23:57:08,582 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-05 23:57:08,582 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224574417]
[2024-11-05 23:57:08,583 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-05 23:57:08,585 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-05 23:57:08,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-05 23:57:08,585 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-05 23:57:08,586 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-05 23:57:08,586 INFO  L87              Difference]: Start difference. First operand 53 states and 78 transitions. Second operand  has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17)
[2024-11-05 23:57:09,018 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 23:57:09,019 INFO  L93              Difference]: Finished difference Result 154 states and 229 transitions.
[2024-11-05 23:57:09,024 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-05 23:57:09,024 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110
[2024-11-05 23:57:09,025 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 23:57:09,026 INFO  L225             Difference]: With dead ends: 154
[2024-11-05 23:57:09,026 INFO  L226             Difference]: Without dead ends: 104
[2024-11-05 23:57:09,027 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-05 23:57:09,028 INFO  L432           NwaCegarLoop]: 74 mSDtfsCounter, 49 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-05 23:57:09,028 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 249 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-05 23:57:09,029 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2024-11-05 23:57:09,050 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86.
[2024-11-05 23:57:09,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 86 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2024-11-05 23:57:09,053 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 127 transitions.
[2024-11-05 23:57:09,053 INFO  L78                 Accepts]: Start accepts. Automaton has 86 states and 127 transitions. Word has length 110
[2024-11-05 23:57:09,054 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 23:57:09,054 INFO  L471      AbstractCegarLoop]: Abstraction has 86 states and 127 transitions.
[2024-11-05 23:57:09,054 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17)
[2024-11-05 23:57:09,056 INFO  L276                IsEmpty]: Start isEmpty. Operand 86 states and 127 transitions.
[2024-11-05 23:57:09,058 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-11-05 23:57:09,058 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 23:57:09,058 INFO  L215           NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:09,074 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-05 23:57:09,258 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:57:09,260 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 23:57:09,260 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 23:57:09,261 INFO  L85        PathProgramCache]: Analyzing trace with hash 1671248508, now seen corresponding path program 1 times
[2024-11-05 23:57:09,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-05 23:57:09,261 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503985534]
[2024-11-05 23:57:09,261 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 23:57:09,261 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:57:09,262 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 23:57:09,264 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:57:09,266 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:57:09,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 23:57:09,397 INFO  L255         TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-05 23:57:09,400 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 23:57:09,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked.
[2024-11-05 23:57:09,712 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-05 23:57:09,713 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-05 23:57:09,713 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503985534]
[2024-11-05 23:57:09,713 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503985534] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-05 23:57:09,713 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-05 23:57:09,713 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-05 23:57:09,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421041051]
[2024-11-05 23:57:09,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-05 23:57:09,714 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-05 23:57:09,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-05 23:57:09,714 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-05 23:57:09,714 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-05 23:57:09,714 INFO  L87              Difference]: Start difference. First operand 86 states and 127 transitions. Second operand  has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17)
[2024-11-05 23:57:09,859 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 23:57:09,859 INFO  L93              Difference]: Finished difference Result 140 states and 208 transitions.
[2024-11-05 23:57:09,860 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-05 23:57:09,860 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111
[2024-11-05 23:57:09,860 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 23:57:09,861 INFO  L225             Difference]: With dead ends: 140
[2024-11-05 23:57:09,861 INFO  L226             Difference]: Without dead ends: 90
[2024-11-05 23:57:09,881 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-05 23:57:09,882 INFO  L432           NwaCegarLoop]: 123 mSDtfsCounter, 60 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-05 23:57:09,882 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 176 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-05 23:57:09,882 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2024-11-05 23:57:09,898 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86.
[2024-11-05 23:57:09,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 86 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2024-11-05 23:57:09,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions.
[2024-11-05 23:57:09,903 INFO  L78                 Accepts]: Start accepts. Automaton has 86 states and 125 transitions. Word has length 111
[2024-11-05 23:57:09,904 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 23:57:09,904 INFO  L471      AbstractCegarLoop]: Abstraction has 86 states and 125 transitions.
[2024-11-05 23:57:09,904 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17)
[2024-11-05 23:57:09,904 INFO  L276                IsEmpty]: Start isEmpty. Operand 86 states and 125 transitions.
[2024-11-05 23:57:09,905 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-05 23:57:09,905 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 23:57:09,905 INFO  L215           NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:09,913 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:57:10,106 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:57:10,106 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 23:57:10,107 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 23:57:10,107 INFO  L85        PathProgramCache]: Analyzing trace with hash -1411965081, now seen corresponding path program 1 times
[2024-11-05 23:57:10,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-05 23:57:10,108 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839169027]
[2024-11-05 23:57:10,108 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 23:57:10,108 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:57:10,108 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 23:57:10,110 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:57:10,114 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:57:10,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 23:57:10,195 INFO  L255         TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-05 23:57:10,198 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 23:57:10,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked.
[2024-11-05 23:57:10,324 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-05 23:57:10,454 INFO  L134       CoverageAnalysis]: Checked inductivity of 544 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked.
[2024-11-05 23:57:10,454 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-05 23:57:10,454 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839169027]
[2024-11-05 23:57:10,454 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839169027] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-05 23:57:10,454 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-05 23:57:10,455 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9
[2024-11-05 23:57:10,455 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692834553]
[2024-11-05 23:57:10,455 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-05 23:57:10,455 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-05 23:57:10,455 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-05 23:57:10,456 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-05 23:57:10,456 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-11-05 23:57:10,456 INFO  L87              Difference]: Start difference. First operand 86 states and 125 transitions. Second operand  has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31)
[2024-11-05 23:57:10,691 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 23:57:10,691 INFO  L93              Difference]: Finished difference Result 152 states and 212 transitions.
[2024-11-05 23:57:10,694 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-05 23:57:10,695 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 112
[2024-11-05 23:57:10,696 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 23:57:10,697 INFO  L225             Difference]: With dead ends: 152
[2024-11-05 23:57:10,697 INFO  L226             Difference]: Without dead ends: 102
[2024-11-05 23:57:10,698 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240
[2024-11-05 23:57:10,699 INFO  L432           NwaCegarLoop]: 50 mSDtfsCounter, 119 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-05 23:57:10,699 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 114 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-05 23:57:10,700 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2024-11-05 23:57:10,716 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94.
[2024-11-05 23:57:10,717 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 states have internal predecessors, (61), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2024-11-05 23:57:10,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions.
[2024-11-05 23:57:10,718 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 112
[2024-11-05 23:57:10,719 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 23:57:10,719 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 129 transitions.
[2024-11-05 23:57:10,719 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31)
[2024-11-05 23:57:10,719 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions.
[2024-11-05 23:57:10,721 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2024-11-05 23:57:10,721 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 23:57:10,721 INFO  L215           NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:10,728 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-05 23:57:10,921 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:57:10,922 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 23:57:10,922 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 23:57:10,922 INFO  L85        PathProgramCache]: Analyzing trace with hash -194657892, now seen corresponding path program 1 times
[2024-11-05 23:57:10,923 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-05 23:57:10,923 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376260412]
[2024-11-05 23:57:10,923 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 23:57:10,923 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:57:10,923 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 23:57:10,926 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:57:10,926 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:57:11,008 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 23:57:11,011 INFO  L255         TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjuncts are in the unsatisfiable core
[2024-11-05 23:57:11,016 INFO  L278         TraceCheckSpWp]: Computing forward predicates...