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


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


This is Ultimate 0.2.5-dev-17387ad-m
[2024-11-06 00:02:17,254 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-06 00:02:17,326 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:17,335 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-06 00:02:17,336 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-06 00:02:17,358 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-06 00:02:17,359 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-06 00:02:17,360 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-06 00:02:17,360 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-06 00:02:17,362 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-06 00:02:17,362 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-06 00:02:17,363 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-06 00:02:17,365 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-06 00:02:17,366 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-06 00:02:17,366 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-06 00:02:17,366 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-06 00:02:17,367 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-06 00:02:17,367 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-06 00:02:17,367 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-06 00:02:17,367 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-06 00:02:17,368 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-06 00:02:17,370 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-06 00:02:17,370 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-06 00:02:17,371 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-06 00:02:17,371 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-06 00:02:17,371 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-06 00:02:17,371 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-06 00:02:17,371 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-06 00:02:17,372 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-06 00:02:17,372 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-06 00:02:17,372 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-06 00:02:17,372 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-06 00:02:17,373 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-06 00:02:17,373 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-06 00:02:17,374 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 00:02:17,374 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-06 00:02:17,374 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-06 00:02:17,374 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-06 00:02:17,375 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-06 00:02:17,375 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-06 00:02:17,375 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-06 00:02:17,375 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-06 00:02:17,375 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-06 00:02:17,376 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-06 00:02:17,376 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:17,614 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-06 00:02:17,651 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-06 00:02:17,654 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-06 00:02:17,656 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-06 00:02:17,657 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-06 00:02:17,658 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-52.i
[2024-11-06 00:02:19,216 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-06 00:02:19,422 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-06 00:02:19,423 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-52.i
[2024-11-06 00:02:19,436 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21be1d385/e345d56c90544218ac1d8d6bad4cfabf/FLAG561777ea7
[2024-11-06 00:02:19,453 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21be1d385/e345d56c90544218ac1d8d6bad4cfabf
[2024-11-06 00:02:19,456 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-06 00:02:19,458 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-11-06 00:02:19,459 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-06 00:02:19,459 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-06 00:02:19,465 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-06 00:02:19,467 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:02:19" (1/1) ...
[2024-11-06 00:02:19,468 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231dffea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:19, skipping insertion in model container
[2024-11-06 00:02:19,468 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:02:19" (1/1) ...
[2024-11-06 00:02:19,496 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-06 00:02:19,662 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-52.i[915,928]
[2024-11-06 00:02:19,710 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-06 00:02:19,734 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-06 00:02:19,746 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-52.i[915,928]
[2024-11-06 00:02:19,773 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-06 00:02:19,796 INFO  L204         MainTranslator]: Completed translation
[2024-11-06 00:02:19,796 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:19 WrapperNode
[2024-11-06 00:02:19,796 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-06 00:02:19,798 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-06 00:02:19,798 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-06 00:02:19,798 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-06 00:02:19,804 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:19" (1/1) ...
[2024-11-06 00:02:19,814 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:19" (1/1) ...
[2024-11-06 00:02:19,843 INFO  L138                Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118
[2024-11-06 00:02:19,848 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-06 00:02:19,849 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-06 00:02:19,849 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-06 00:02:19,849 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-06 00:02:19,861 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:19" (1/1) ...
[2024-11-06 00:02:19,861 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:19" (1/1) ...
[2024-11-06 00:02:19,865 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:19" (1/1) ...
[2024-11-06 00:02:19,885 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:19,886 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:19" (1/1) ...
[2024-11-06 00:02:19,886 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:19" (1/1) ...
[2024-11-06 00:02:19,893 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:19" (1/1) ...
[2024-11-06 00:02:19,897 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:19" (1/1) ...
[2024-11-06 00:02:19,899 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:19" (1/1) ...
[2024-11-06 00:02:19,902 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:19" (1/1) ...
[2024-11-06 00:02:19,905 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-06 00:02:19,906 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-06 00:02:19,906 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-06 00:02:19,906 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-06 00:02:19,907 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:19" (1/1) ...
[2024-11-06 00:02:19,914 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 00:02:19,926 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 00:02:19,946 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:19,950 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:19,980 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-06 00:02:19,980 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-06 00:02:19,981 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-06 00:02:19,981 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-06 00:02:19,981 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-06 00:02:19,981 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-06 00:02:20,075 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-06 00:02:20,077 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-06 00:02:20,452 INFO  L?                        ?]: Removed 22 outVars from TransFormulas that were not future-live.
[2024-11-06 00:02:20,452 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-06 00:02:20,473 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-06 00:02:20,473 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-06 00:02:20,473 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:02:20 BoogieIcfgContainer
[2024-11-06 00:02:20,474 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-06 00:02:20,476 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-06 00:02:20,476 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-06 00:02:20,480 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-06 00:02:20,480 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:02:19" (1/3) ...
[2024-11-06 00:02:20,481 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2e9033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:02:20, skipping insertion in model container
[2024-11-06 00:02:20,482 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:19" (2/3) ...
[2024-11-06 00:02:20,482 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2e9033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:02:20, skipping insertion in model container
[2024-11-06 00:02:20,482 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:02:20" (3/3) ...
[2024-11-06 00:02:20,484 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-52.i
[2024-11-06 00:02:20,509 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-06 00:02:20,510 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-06 00:02:20,570 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-06 00:02:20,577 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;@185b5b72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-06 00:02:20,577 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-06 00:02:20,583 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2024-11-06 00:02:20,594 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-06 00:02:20,594 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:02:20,595 INFO  L215           NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,595 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:02:20,602 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:02:20,602 INFO  L85        PathProgramCache]: Analyzing trace with hash 384959832, now seen corresponding path program 1 times
[2024-11-06 00:02:20,619 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:02:20,619 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422986796]
[2024-11-06 00:02:20,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:02:20,620 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:20,620 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:02:20,623 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:20,640 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:20,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:02:20,820 INFO  L255         TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-06 00:02:20,829 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:02:20,872 INFO  L134       CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked.
[2024-11-06 00:02:20,873 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:02:20,874 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:02:20,874 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422986796]
[2024-11-06 00:02:20,875 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [422986796] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:02:20,875 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:02:20,875 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 00:02:20,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68269548]
[2024-11-06 00:02:20,878 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:02:20,882 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-06 00:02:20,882 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:02:20,906 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-06 00:02:20,907 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-06 00:02:20,910 INFO  L87              Difference]: Start difference. First operand  has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand  has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)
[2024-11-06 00:02:20,936 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:02:20,937 INFO  L93              Difference]: Finished difference Result 97 states and 158 transitions.
[2024-11-06 00:02:20,938 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-06 00:02:20,940 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 86
[2024-11-06 00:02:20,940 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:02:20,948 INFO  L225             Difference]: With dead ends: 97
[2024-11-06 00:02:20,950 INFO  L226             Difference]: Without dead ends: 48
[2024-11-06 00:02:20,953 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 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:20,959 INFO  L432           NwaCegarLoop]: 69 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, 69 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:20,960 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 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:20,975 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2024-11-06 00:02:21,001 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2024-11-06 00:02:21,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2024-11-06 00:02:21,007 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions.
[2024-11-06 00:02:21,009 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 86
[2024-11-06 00:02:21,010 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:02:21,010 INFO  L471      AbstractCegarLoop]: Abstraction has 48 states and 69 transitions.
[2024-11-06 00:02:21,010 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)
[2024-11-06 00:02:21,010 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions.
[2024-11-06 00:02:21,015 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-06 00:02:21,015 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:02:21,015 INFO  L215           NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,023 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:21,217 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:21,218 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:02:21,219 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:02:21,219 INFO  L85        PathProgramCache]: Analyzing trace with hash 260844888, now seen corresponding path program 1 times
[2024-11-06 00:02:21,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:02:21,220 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268313249]
[2024-11-06 00:02:21,220 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:02:21,220 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:21,220 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:02:21,224 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:21,225 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:21,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:02:21,343 INFO  L255         TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-06 00:02:21,348 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:02:21,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2024-11-06 00:02:21,451 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:02:21,451 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:02:21,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268313249]
[2024-11-06 00:02:21,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [268313249] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:02:21,452 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:02:21,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 00:02:21,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815809906]
[2024-11-06 00:02:21,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:02:21,458 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 00:02:21,458 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:02:21,459 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 00:02:21,460 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 00:02:21,460 INFO  L87              Difference]: Start difference. First operand 48 states and 69 transitions. Second operand  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2024-11-06 00:02:21,522 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:02:21,522 INFO  L93              Difference]: Finished difference Result 92 states and 133 transitions.
[2024-11-06 00:02:21,528 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-06 00:02:21,528 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86
[2024-11-06 00:02:21,529 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:02:21,530 INFO  L225             Difference]: With dead ends: 92
[2024-11-06 00:02:21,530 INFO  L226             Difference]: Without dead ends: 47
[2024-11-06 00:02:21,531 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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:21,532 INFO  L432           NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-06 00:02:21,533 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-06 00:02:21,535 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2024-11-06 00:02:21,541 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2024-11-06 00:02:21,542 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2024-11-06 00:02:21,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions.
[2024-11-06 00:02:21,545 INFO  L78                 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 86
[2024-11-06 00:02:21,547 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:02:21,547 INFO  L471      AbstractCegarLoop]: Abstraction has 47 states and 66 transitions.
[2024-11-06 00:02:21,547 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2024-11-06 00:02:21,547 INFO  L276                IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions.
[2024-11-06 00:02:21,550 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-06 00:02:21,550 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:02:21,550 INFO  L215           NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,559 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:21,751 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:21,751 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:02:21,752 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:02:21,752 INFO  L85        PathProgramCache]: Analyzing trace with hash 1833572630, now seen corresponding path program 1 times
[2024-11-06 00:02:21,753 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:02:21,753 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738930736]
[2024-11-06 00:02:21,753 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:02:21,753 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:21,754 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:02:21,755 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:21,756 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:21,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:02:21,880 INFO  L255         TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-06 00:02:21,885 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:02:22,037 INFO  L134       CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2024-11-06 00:02:22,037 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:02:22,037 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:02:22,038 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738930736]
[2024-11-06 00:02:22,038 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [738930736] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:02:22,038 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:02:22,038 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-06 00:02:22,038 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621748087]
[2024-11-06 00:02:22,038 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:02:22,039 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-06 00:02:22,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:02:22,042 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-06 00:02:22,042 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-06 00:02:22,043 INFO  L87              Difference]: Start difference. First operand 47 states and 66 transitions. Second operand  has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2024-11-06 00:02:22,504 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:02:22,505 INFO  L93              Difference]: Finished difference Result 135 states and 192 transitions.
[2024-11-06 00:02:22,509 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-06 00:02:22,509 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86
[2024-11-06 00:02:22,510 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:02:22,511 INFO  L225             Difference]: With dead ends: 135
[2024-11-06 00:02:22,511 INFO  L226             Difference]: Without dead ends: 91
[2024-11-06 00:02:22,512 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-06 00:02:22,513 INFO  L432           NwaCegarLoop]: 97 mSDtfsCounter, 58 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-06 00:02:22,514 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 181 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-06 00:02:22,515 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2024-11-06 00:02:22,529 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 50.
[2024-11-06 00:02:22,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 50 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2024-11-06 00:02:22,530 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions.
[2024-11-06 00:02:22,531 INFO  L78                 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 86
[2024-11-06 00:02:22,533 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:02:22,534 INFO  L471      AbstractCegarLoop]: Abstraction has 50 states and 69 transitions.
[2024-11-06 00:02:22,534 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2024-11-06 00:02:22,535 INFO  L276                IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions.
[2024-11-06 00:02:22,536 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-06 00:02:22,536 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:02:22,537 INFO  L215           NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,543 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-06 00:02:22,737 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:22,738 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:02:22,738 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:02:22,738 INFO  L85        PathProgramCache]: Analyzing trace with hash 1575407192, now seen corresponding path program 1 times
[2024-11-06 00:02:22,739 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:02:22,739 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166938534]
[2024-11-06 00:02:22,739 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:02:22,739 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:22,740 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:02:22,743 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:22,744 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:22,926 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:02:22,930 INFO  L255         TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 36 conjuncts are in the unsatisfiable core
[2024-11-06 00:02:22,947 INFO  L278         TraceCheckSpWp]: Computing forward predicates...