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


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


This is Ultimate 0.2.5-dev-17387ad-m
[2024-11-06 00:02:20,506 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-06 00:02:20,585 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-06 00:02:20,592 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-06 00:02:20,592 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-06 00:02:20,621 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-06 00:02:20,621 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-06 00:02:20,622 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-06 00:02:20,622 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-06 00:02:20,623 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-06 00:02:20,623 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-06 00:02:20,624 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-06 00:02:20,624 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-06 00:02:20,628 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-06 00:02:20,629 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-06 00:02:20,629 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-06 00:02:20,630 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-06 00:02:20,630 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-06 00:02:20,630 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-06 00:02:20,630 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-06 00:02:20,630 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-06 00:02:20,631 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-06 00:02:20,631 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-06 00:02:20,631 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-06 00:02:20,632 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-06 00:02:20,632 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-06 00:02:20,632 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-06 00:02:20,632 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-06 00:02:20,633 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-06 00:02:20,633 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-06 00:02:20,633 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-06 00:02:20,633 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-06 00:02:20,634 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-06 00:02:20,634 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-06 00:02:20,634 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 00:02:20,634 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-06 00:02:20,634 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-06 00:02:20,635 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-06 00:02:20,635 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-06 00:02:20,635 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-06 00:02:20,635 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-06 00:02:20,636 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-06 00:02:20,636 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-06 00:02:20,636 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-06 00:02:20,636 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF
[2024-11-06 00:02:20,871 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-06 00:02:20,898 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-06 00:02:20,902 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-06 00:02:20,903 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-06 00:02:20,904 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-06 00:02:20,905 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-53.i
[2024-11-06 00:02:22,453 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-06 00:02:22,654 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-06 00:02:22,655 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-53.i
[2024-11-06 00:02:22,665 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6164de6/8a748ba702ee4e6ba09655a5801e619f/FLAGda202fd68
[2024-11-06 00:02:22,679 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6164de6/8a748ba702ee4e6ba09655a5801e619f
[2024-11-06 00:02:22,681 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-06 00:02:22,683 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-11-06 00:02:22,684 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-06 00:02:22,684 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-06 00:02:22,689 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-06 00:02:22,690 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:02:22" (1/1) ...
[2024-11-06 00:02:22,691 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655bf04c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:22, skipping insertion in model container
[2024-11-06 00:02:22,692 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:02:22" (1/1) ...
[2024-11-06 00:02:22,725 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-06 00:02:22,895 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-53.i[915,928]
[2024-11-06 00:02:22,952 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-06 00:02:22,965 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-06 00:02:22,977 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-53.i[915,928]
[2024-11-06 00:02:23,007 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-06 00:02:23,025 INFO  L204         MainTranslator]: Completed translation
[2024-11-06 00:02:23,026 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:23 WrapperNode
[2024-11-06 00:02:23,026 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-06 00:02:23,027 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-06 00:02:23,027 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-06 00:02:23,027 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-06 00:02:23,033 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:23" (1/1) ...
[2024-11-06 00:02:23,042 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:23" (1/1) ...
[2024-11-06 00:02:23,064 INFO  L138                Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133
[2024-11-06 00:02:23,065 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-06 00:02:23,066 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-06 00:02:23,066 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-06 00:02:23,066 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-06 00:02:23,074 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:23" (1/1) ...
[2024-11-06 00:02:23,074 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:23" (1/1) ...
[2024-11-06 00:02:23,080 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:23" (1/1) ...
[2024-11-06 00:02:23,095 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-06 00:02:23,096 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:23" (1/1) ...
[2024-11-06 00:02:23,096 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:23" (1/1) ...
[2024-11-06 00:02:23,114 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:23" (1/1) ...
[2024-11-06 00:02:23,122 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:23" (1/1) ...
[2024-11-06 00:02:23,128 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:23" (1/1) ...
[2024-11-06 00:02:23,133 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:23" (1/1) ...
[2024-11-06 00:02:23,137 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-06 00:02:23,142 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-06 00:02:23,142 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-06 00:02:23,142 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-06 00:02:23,143 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:23" (1/1) ...
[2024-11-06 00:02:23,152 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 00:02:23,163 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 00:02:23,179 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-06 00:02:23,182 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-06 00:02:23,207 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-06 00:02:23,207 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-06 00:02:23,208 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-06 00:02:23,208 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-06 00:02:23,208 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-06 00:02:23,208 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-06 00:02:23,293 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-06 00:02:23,301 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-06 00:02:23,903 INFO  L?                        ?]: Removed 22 outVars from TransFormulas that were not future-live.
[2024-11-06 00:02:23,904 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-06 00:02:23,917 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-06 00:02:23,917 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-06 00:02:23,918 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:02:23 BoogieIcfgContainer
[2024-11-06 00:02:23,918 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-06 00:02:23,921 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-06 00:02:23,921 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-06 00:02:23,924 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-06 00:02:23,924 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:02:22" (1/3) ...
[2024-11-06 00:02:23,925 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792be417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:02:23, skipping insertion in model container
[2024-11-06 00:02:23,925 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:23" (2/3) ...
[2024-11-06 00:02:23,925 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792be417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:02:23, skipping insertion in model container
[2024-11-06 00:02:23,925 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:02:23" (3/3) ...
[2024-11-06 00:02:23,927 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-53.i
[2024-11-06 00:02:23,942 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-06 00:02:23,943 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-06 00:02:24,023 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-06 00:02:24,030 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;@144db292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-06 00:02:24,031 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-06 00:02:24,035 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 58 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 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-06 00:02:24,049 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-06 00:02:24,049 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:02:24,050 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-06 00:02:24,050 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:02:24,055 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:02:24,056 INFO  L85        PathProgramCache]: Analyzing trace with hash 1319720570, now seen corresponding path program 1 times
[2024-11-06 00:02:24,071 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:02:24,072 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815760113]
[2024-11-06 00:02:24,073 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:02:24,073 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-06 00:02:24,073 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:02:24,077 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-06 00:02:24,082 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-06 00:02:24,349 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:02:24,358 INFO  L255         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-06 00:02:24,368 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:02:24,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked.
[2024-11-06 00:02:24,414 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:02:24,414 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:02:24,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815760113]
[2024-11-06 00:02:24,415 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [815760113] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:02:24,416 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:02:24,416 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 00:02:24,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661302006]
[2024-11-06 00:02:24,418 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:02:24,423 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-06 00:02:24,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:02:24,450 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-06 00:02:24,451 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-06 00:02:24,454 INFO  L87              Difference]: Start difference. First operand  has 58 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-06 00:02:24,485 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:02:24,486 INFO  L93              Difference]: Finished difference Result 109 states and 183 transitions.
[2024-11-06 00:02:24,487 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-06 00:02:24,488 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 112
[2024-11-06 00:02:24,488 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:02:24,497 INFO  L225             Difference]: With dead ends: 109
[2024-11-06 00:02:24,497 INFO  L226             Difference]: Without dead ends: 54
[2024-11-06 00:02:24,502 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-06 00:02:24,507 INFO  L432           NwaCegarLoop]: 79 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, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-06 00:02:24,509 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-06 00:02:24,525 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2024-11-06 00:02:24,546 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2024-11-06 00:02:24,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 54 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 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-06 00:02:24,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions.
[2024-11-06 00:02:24,552 INFO  L78                 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 112
[2024-11-06 00:02:24,552 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:02:24,552 INFO  L471      AbstractCegarLoop]: Abstraction has 54 states and 79 transitions.
[2024-11-06 00:02:24,553 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-06 00:02:24,553 INFO  L276                IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions.
[2024-11-06 00:02:24,559 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-06 00:02:24,560 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:02:24,560 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-06 00:02:24,574 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-11-06 00:02:24,761 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-06 00:02:24,762 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:02:24,763 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:02:24,763 INFO  L85        PathProgramCache]: Analyzing trace with hash -1931518288, now seen corresponding path program 1 times
[2024-11-06 00:02:24,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:02:24,764 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14760494]
[2024-11-06 00:02:24,764 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:02:24,765 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-06 00:02:24,765 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:02:24,767 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-06 00:02:24,769 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-06 00:02:24,989 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:02:24,999 INFO  L255         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-06 00:02:25,010 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:02:25,066 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-06 00:02:25,067 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:02:25,067 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:02:25,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14760494]
[2024-11-06 00:02:25,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [14760494] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:02:25,068 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:02:25,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 00:02:25,069 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001425646]
[2024-11-06 00:02:25,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:02:25,070 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 00:02:25,071 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:02:25,071 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 00:02:25,072 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 00:02:25,072 INFO  L87              Difference]: Start difference. First operand 54 states and 79 transitions. Second operand  has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-06 00:02:25,575 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:02:25,575 INFO  L93              Difference]: Finished difference Result 154 states and 227 transitions.
[2024-11-06 00:02:25,576 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-06 00:02:25,576 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 112
[2024-11-06 00:02:25,577 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:02:25,580 INFO  L225             Difference]: With dead ends: 154
[2024-11-06 00:02:25,580 INFO  L226             Difference]: Without dead ends: 103
[2024-11-06 00:02:25,581 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 00:02:25,582 INFO  L432           NwaCegarLoop]: 133 mSDtfsCounter, 68 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-06 00:02:25,583 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 200 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-06 00:02:25,584 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2024-11-06 00:02:25,614 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101.
[2024-11-06 00:02:25,614 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101 states, 64 states have (on average 1.25) internal successors, (80), 64 states have internal predecessors, (80), 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-06 00:02:25,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions.
[2024-11-06 00:02:25,617 INFO  L78                 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 112
[2024-11-06 00:02:25,618 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:02:25,618 INFO  L471      AbstractCegarLoop]: Abstraction has 101 states and 148 transitions.
[2024-11-06 00:02:25,618 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-06 00:02:25,619 INFO  L276                IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions.
[2024-11-06 00:02:25,620 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2024-11-06 00:02:25,620 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:02:25,621 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]
[2024-11-06 00:02:25,634 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-06 00:02:25,821 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-06 00:02:25,822 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:02:25,823 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:02:25,823 INFO  L85        PathProgramCache]: Analyzing trace with hash 16914940, now seen corresponding path program 1 times
[2024-11-06 00:02:25,824 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:02:25,824 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655006920]
[2024-11-06 00:02:25,824 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:02:25,824 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-06 00:02:25,824 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:02:25,826 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-06 00:02:25,827 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-06 00:02:26,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:02:26,063 INFO  L255         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-06 00:02:26,067 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:02:26,392 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-06 00:02:26,392 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:02:26,392 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:02:26,393 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655006920]
[2024-11-06 00:02:26,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [655006920] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:02:26,393 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:02:26,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 00:02:26,393 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762915283]
[2024-11-06 00:02:26,394 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:02:26,394 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 00:02:26,394 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:02:26,395 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 00:02:26,395 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 00:02:26,396 INFO  L87              Difference]: Start difference. First operand 101 states and 148 transitions. Second operand  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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-06 00:02:26,811 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:02:26,811 INFO  L93              Difference]: Finished difference Result 207 states and 303 transitions.
[2024-11-06 00:02:26,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-06 00:02:26,812 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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 113
[2024-11-06 00:02:26,813 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:02:26,815 INFO  L225             Difference]: With dead ends: 207
[2024-11-06 00:02:26,815 INFO  L226             Difference]: Without dead ends: 109
[2024-11-06 00:02:26,816 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 00:02:26,818 INFO  L432           NwaCegarLoop]: 73 mSDtfsCounter, 17 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-06 00:02:26,818 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 138 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-06 00:02:26,819 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2024-11-06 00:02:26,846 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107.
[2024-11-06 00:02:26,847 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 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-06 00:02:26,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions.
[2024-11-06 00:02:26,851 INFO  L78                 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 113
[2024-11-06 00:02:26,851 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:02:26,851 INFO  L471      AbstractCegarLoop]: Abstraction has 107 states and 155 transitions.
[2024-11-06 00:02:26,852 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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-06 00:02:26,852 INFO  L276                IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions.
[2024-11-06 00:02:26,853 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2024-11-06 00:02:26,854 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:02:26,854 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]
[2024-11-06 00:02:26,867 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-11-06 00:02:27,054 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-06 00:02:27,055 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:02:27,056 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:02:27,056 INFO  L85        PathProgramCache]: Analyzing trace with hash -128748962, now seen corresponding path program 1 times
[2024-11-06 00:02:27,056 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:02:27,057 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813263075]
[2024-11-06 00:02:27,057 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:02:27,057 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-06 00:02:27,057 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:02:27,060 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-06 00:02:27,062 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-06 00:02:27,274 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:02:27,284 INFO  L255         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-06 00:02:27,287 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:02:27,328 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-06 00:02:27,328 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:02:27,328 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:02:27,329 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813263075]
[2024-11-06 00:02:27,329 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [813263075] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:02:27,329 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:02:27,329 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 00:02:27,329 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633556471]
[2024-11-06 00:02:27,329 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:02:27,330 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 00:02:27,330 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:02:27,331 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 00:02:27,331 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 00:02:27,331 INFO  L87              Difference]: Start difference. First operand 107 states and 155 transitions. Second operand  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-06 00:02:27,830 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:02:27,830 INFO  L93              Difference]: Finished difference Result 270 states and 392 transitions.
[2024-11-06 00:02:27,830 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-06 00:02:27,831 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 113
[2024-11-06 00:02:27,832 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:02:27,833 INFO  L225             Difference]: With dead ends: 270
[2024-11-06 00:02:27,833 INFO  L226             Difference]: Without dead ends: 166
[2024-11-06 00:02:27,838 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 00:02:27,839 INFO  L432           NwaCegarLoop]: 141 mSDtfsCounter, 70 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-06 00:02:27,840 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 208 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-06 00:02:27,841 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 166 states.
[2024-11-06 00:02:27,866 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 109.
[2024-11-06 00:02:27,867 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 109 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 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-06 00:02:27,868 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions.
[2024-11-06 00:02:27,868 INFO  L78                 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 113
[2024-11-06 00:02:27,869 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:02:27,869 INFO  L471      AbstractCegarLoop]: Abstraction has 109 states and 157 transitions.
[2024-11-06 00:02:27,872 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-06 00:02:27,872 INFO  L276                IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions.
[2024-11-06 00:02:27,874 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2024-11-06 00:02:27,875 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:02:27,875 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]
[2024-11-06 00:02:27,889 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-06 00:02:28,075 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-06 00:02:28,076 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:02:28,076 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:02:28,076 INFO  L85        PathProgramCache]: Analyzing trace with hash 1646258400, now seen corresponding path program 1 times
[2024-11-06 00:02:28,077 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:02:28,077 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573501502]
[2024-11-06 00:02:28,077 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:02:28,077 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-06 00:02:28,078 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:02:28,079 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-06 00:02:28,081 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-11-06 00:02:28,253 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:02:28,262 INFO  L255         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-06 00:02:28,266 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:02:28,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 544 backedges. 106 proven. 3 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2024-11-06 00:02:28,421 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-06 00:02:28,664 INFO  L134       CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked.
[2024-11-06 00:02:28,665 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:02:28,665 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573501502]
[2024-11-06 00:02:28,665 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [573501502] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-06 00:02:28,665 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-06 00:02:28,665 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12
[2024-11-06 00:02:28,665 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070983407]
[2024-11-06 00:02:28,666 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-06 00:02:28,666 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-06 00:02:28,666 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:02:28,667 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-06 00:02:28,667 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2024-11-06 00:02:28,667 INFO  L87              Difference]: Start difference. First operand 109 states and 157 transitions. Second operand  has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19)
[2024-11-06 00:02:30,494 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:02:30,494 INFO  L93              Difference]: Finished difference Result 342 states and 481 transitions.
[2024-11-06 00:02:30,495 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-11-06 00:02:30,495 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 113
[2024-11-06 00:02:30,496 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:02:30,500 INFO  L225             Difference]: With dead ends: 342
[2024-11-06 00:02:30,500 INFO  L226             Difference]: Without dead ends: 236
[2024-11-06 00:02:30,501 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992
[2024-11-06 00:02:30,505 INFO  L432           NwaCegarLoop]: 104 mSDtfsCounter, 258 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2024-11-06 00:02:30,506 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 494 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2024-11-06 00:02:30,507 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 236 states.
[2024-11-06 00:02:30,537 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 115.
[2024-11-06 00:02:30,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 115 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 76 states have internal predecessors, (92), 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-06 00:02:30,539 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions.
[2024-11-06 00:02:30,540 INFO  L78                 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 113
[2024-11-06 00:02:30,540 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:02:30,540 INFO  L471      AbstractCegarLoop]: Abstraction has 115 states and 160 transitions.
[2024-11-06 00:02:30,541 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19)
[2024-11-06 00:02:30,541 INFO  L276                IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions.
[2024-11-06 00:02:30,542 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2024-11-06 00:02:30,542 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:02:30,542 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-06 00:02:30,554 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2024-11-06 00:02:30,746 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-06 00:02:30,747 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:02:30,748 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:02:30,748 INFO  L85        PathProgramCache]: Analyzing trace with hash 68189198, now seen corresponding path program 1 times
[2024-11-06 00:02:30,748 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:02:30,748 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460510846]
[2024-11-06 00:02:30,748 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:02:30,749 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-06 00:02:30,749 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:02:30,752 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-06 00:02:30,753 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 (7)] Waiting until timeout for monitored process
[2024-11-06 00:02:30,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:02:31,001 INFO  L255         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 22 conjuncts are in the unsatisfiable core
[2024-11-06 00:02:31,007 INFO  L278         TraceCheckSpWp]: Computing forward predicates...