/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 --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-68.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 08:00:21,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 08:00:21,374 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-03 08:00:21,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 08:00:21,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 08:00:21,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 08:00:21,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 08:00:21,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 08:00:21,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 08:00:21,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 08:00:21,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 08:00:21,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 08:00:21,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 08:00:21,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 08:00:21,410 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 08:00:21,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 08:00:21,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 08:00:21,411 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 08:00:21,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 08:00:21,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 08:00:21,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 08:00:21,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 08:00:21,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 08:00:21,416 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 08:00:21,416 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 08:00:21,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 08:00:21,416 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 08:00:21,417 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 08:00:21,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 08:00:21,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 08:00:21,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 08:00:21,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 08:00:21,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 08:00:21,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 08:00:21,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 08:00:21,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 08:00:21,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 08:00:21,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 08:00:21,419 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 08:00:21,420 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 08:00:21,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 08:00:21,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 08:00:21,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 08:00:21,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 08:00:21,421 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> 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-03 08:00:21,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 08:00:21,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 08:00:21,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 08:00:21,694 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 08:00:21,695 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 08:00:21,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-68.i [2024-11-03 08:00:23,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 08:00:23,406 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 08:00:23,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-68.i [2024-11-03 08:00:23,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4ee83f8/d1a1a6cf3028450d8c5afd0d92eee7f2/FLAG094943152 [2024-11-03 08:00:23,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4ee83f8/d1a1a6cf3028450d8c5afd0d92eee7f2 [2024-11-03 08:00:23,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 08:00:23,440 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 08:00:23,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 08:00:23,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 08:00:23,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 08:00:23,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 08:00:23" (1/1) ... [2024-11-03 08:00:23,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf1e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23, skipping insertion in model container [2024-11-03 08:00:23,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 08:00:23" (1/1) ... [2024-11-03 08:00:23,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 08:00:23,653 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_amount100_file-68.i[916,929] [2024-11-03 08:00:23,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 08:00:23,754 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 08:00:23,763 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_amount100_file-68.i[916,929] [2024-11-03 08:00:23,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 08:00:23,837 INFO L204 MainTranslator]: Completed translation [2024-11-03 08:00:23,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23 WrapperNode [2024-11-03 08:00:23,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 08:00:23,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 08:00:23,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 08:00:23,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 08:00:23,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23" (1/1) ... [2024-11-03 08:00:23,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23" (1/1) ... [2024-11-03 08:00:23,890 INFO L138 Inliner]: procedures = 27, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2024-11-03 08:00:23,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 08:00:23,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 08:00:23,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 08:00:23,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 08:00:23,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23" (1/1) ... [2024-11-03 08:00:23,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23" (1/1) ... [2024-11-03 08:00:23,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23" (1/1) ... [2024-11-03 08:00:23,926 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-03 08:00:23,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23" (1/1) ... [2024-11-03 08:00:23,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23" (1/1) ... [2024-11-03 08:00:23,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23" (1/1) ... [2024-11-03 08:00:23,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23" (1/1) ... [2024-11-03 08:00:23,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23" (1/1) ... [2024-11-03 08:00:23,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23" (1/1) ... [2024-11-03 08:00:23,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 08:00:23,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 08:00:23,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 08:00:23,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 08:00:23,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23" (1/1) ... [2024-11-03 08:00:23,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 08:00:23,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 08:00:24,007 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-03 08:00:24,012 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-03 08:00:24,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 08:00:24,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 08:00:24,037 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-03 08:00:24,038 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-03 08:00:24,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 08:00:24,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 08:00:24,162 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 08:00:24,165 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 08:00:26,037 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-03 08:00:26,037 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 08:00:26,054 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 08:00:26,054 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 08:00:26,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 08:00:26 BoogieIcfgContainer [2024-11-03 08:00:26,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 08:00:26,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 08:00:26,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 08:00:26,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 08:00:26,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 08:00:23" (1/3) ... [2024-11-03 08:00:26,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0d7338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 08:00:26, skipping insertion in model container [2024-11-03 08:00:26,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:00:23" (2/3) ... [2024-11-03 08:00:26,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0d7338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 08:00:26, skipping insertion in model container [2024-11-03 08:00:26,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 08:00:26" (3/3) ... [2024-11-03 08:00:26,065 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-68.i [2024-11-03 08:00:26,080 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 08:00:26,081 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 08:00:26,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 08:00:26,156 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;@2b1cf46c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 08:00:26,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 08:00:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 63 states have internal predecessors, (84), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-03 08:00:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-03 08:00:26,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:00:26,180 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 08:00:26,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:00:26,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:00:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash -820819256, now seen corresponding path program 1 times [2024-11-03 08:00:26,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:00:26,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1249316054] [2024-11-03 08:00:26,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:00:26,196 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-03 08:00:26,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:00:26,200 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-03 08:00:26,202 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-03 08:00:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:00:26,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 08:00:26,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:00:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 2482 trivial. 0 not checked. [2024-11-03 08:00:26,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:00:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2024-11-03 08:00:27,228 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:00:27,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1249316054] [2024-11-03 08:00:27,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1249316054] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 08:00:27,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 08:00:27,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-03 08:00:27,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108267839] [2024-11-03 08:00:27,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 08:00:27,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 08:00:27,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:00:27,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 08:00:27,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 08:00:27,273 INFO L87 Difference]: Start difference. First operand has 105 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 63 states have internal predecessors, (84), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-03 08:00:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:00:27,305 INFO L93 Difference]: Finished difference Result 203 states and 362 transitions. [2024-11-03 08:00:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 08:00:27,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 251 [2024-11-03 08:00:27,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:00:27,314 INFO L225 Difference]: With dead ends: 203 [2024-11-03 08:00:27,315 INFO L226 Difference]: Without dead ends: 101 [2024-11-03 08:00:27,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 500 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-03 08:00:27,323 INFO L432 NwaCegarLoop]: 157 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, 157 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-03 08:00:27,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 08:00:27,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-03 08:00:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-03 08:00:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 59 states have (on average 1.305084745762712) internal successors, (77), 59 states have internal predecessors, (77), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-03 08:00:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 157 transitions. [2024-11-03 08:00:27,378 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 157 transitions. Word has length 251 [2024-11-03 08:00:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:00:27,379 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 157 transitions. [2024-11-03 08:00:27,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-03 08:00:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 157 transitions. [2024-11-03 08:00:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-03 08:00:27,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:00:27,389 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 08:00:27,408 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-03 08:00:27,591 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-03 08:00:27,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:00:27,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:00:27,592 INFO L85 PathProgramCache]: Analyzing trace with hash 666519812, now seen corresponding path program 1 times [2024-11-03 08:00:27,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:00:27,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [982729356] [2024-11-03 08:00:27,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:00:27,593 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-03 08:00:27,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:00:27,595 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-03 08:00:27,596 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-03 08:00:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:00:28,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 08:00:28,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:00:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-03 08:00:28,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:00:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-03 08:00:28,547 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:00:28,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [982729356] [2024-11-03 08:00:28,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [982729356] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:00:28,548 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:00:28,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 08:00:28,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70869186] [2024-11-03 08:00:28,549 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:00:28,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 08:00:28,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:00:28,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 08:00:28,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 08:00:28,555 INFO L87 Difference]: Start difference. First operand 101 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-03 08:00:29,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 08:00:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:00:29,924 INFO L93 Difference]: Finished difference Result 199 states and 311 transitions. [2024-11-03 08:00:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 08:00:29,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 251 [2024-11-03 08:00:29,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:00:29,953 INFO L225 Difference]: With dead ends: 199 [2024-11-03 08:00:29,953 INFO L226 Difference]: Without dead ends: 101 [2024-11-03 08:00:29,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 498 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-03 08:00:29,955 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-03 08:00:29,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 459 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-03 08:00:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-03 08:00:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-03 08:00:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 59 states have internal predecessors, (76), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-03 08:00:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2024-11-03 08:00:29,978 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 251 [2024-11-03 08:00:29,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:00:29,981 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2024-11-03 08:00:29,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-03 08:00:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2024-11-03 08:00:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-03 08:00:29,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:00:29,993 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 08:00:30,013 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-03 08:00:30,193 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-03 08:00:30,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:00:30,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:00:30,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1022423930, now seen corresponding path program 1 times [2024-11-03 08:00:30,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:00:30,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [5317762] [2024-11-03 08:00:30,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:00:30,196 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-03 08:00:30,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:00:30,199 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-03 08:00:30,200 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-03 08:00:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:00:30,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 08:00:30,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:00:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1219 proven. 87 refuted. 0 times theorem prover too weak. 1814 trivial. 0 not checked. [2024-11-03 08:00:31,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:00:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-11-03 08:00:32,310 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:00:32,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [5317762] [2024-11-03 08:00:32,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [5317762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 08:00:32,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 08:00:32,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-03 08:00:32,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983404886] [2024-11-03 08:00:32,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 08:00:32,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 08:00:32,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:00:32,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 08:00:32,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-03 08:00:32,314 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2024-11-03 08:00:34,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 08:00:35,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 08:00:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:00:36,081 INFO L93 Difference]: Finished difference Result 313 states and 476 transitions. [2024-11-03 08:00:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-03 08:00:36,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) Word has length 251 [2024-11-03 08:00:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:00:36,086 INFO L225 Difference]: With dead ends: 313 [2024-11-03 08:00:36,086 INFO L226 Difference]: Without dead ends: 215 [2024-11-03 08:00:36,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 494 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-03 08:00:36,089 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 167 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-03 08:00:36,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 360 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-03 08:00:36,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-03 08:00:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 205. [2024-11-03 08:00:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 120 states have (on average 1.275) internal successors, (153), 120 states have internal predecessors, (153), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-03 08:00:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 313 transitions. [2024-11-03 08:00:36,136 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 313 transitions. Word has length 251 [2024-11-03 08:00:36,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:00:36,139 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 313 transitions. [2024-11-03 08:00:36,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2024-11-03 08:00:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 313 transitions. [2024-11-03 08:00:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-03 08:00:36,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:00:36,143 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 08:00:36,162 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-03 08:00:36,343 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-03 08:00:36,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:00:36,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:00:36,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1020576888, now seen corresponding path program 1 times [2024-11-03 08:00:36,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:00:36,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1974852649] [2024-11-03 08:00:36,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:00:36,346 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-03 08:00:36,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:00:36,349 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-03 08:00:36,350 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-03 08:00:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:00:36,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-03 08:00:36,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:00:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2073 proven. 228 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2024-11-03 08:00:40,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:00:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 39 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-11-03 08:00:43,980 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:00:43,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1974852649] [2024-11-03 08:00:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1974852649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 08:00:43,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 08:00:43,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2024-11-03 08:00:43,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872887851] [2024-11-03 08:00:43,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 08:00:43,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-03 08:00:43,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:00:43,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-03 08:00:43,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-11-03 08:00:43,983 INFO L87 Difference]: Start difference. First operand 205 states and 313 transitions. Second operand has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 6 states have call successors, (68), 5 states have call predecessors, (68), 8 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-03 08:00:48,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 08:00:54,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 08:00:58,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 08:01:02,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 08:01:07,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 08:01:12,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 08:01:16,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 08:01:20,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 08:01:25,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 08:01:32,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 08:01:36,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:01:36,235 INFO L93 Difference]: Finished difference Result 457 states and 665 transitions. [2024-11-03 08:01:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-03 08:01:36,276 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 6 states have call successors, (68), 5 states have call predecessors, (68), 8 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) Word has length 251 [2024-11-03 08:01:36,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:01:36,279 INFO L225 Difference]: With dead ends: 457 [2024-11-03 08:01:36,280 INFO L226 Difference]: Without dead ends: 255 [2024-11-03 08:01:36,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 484 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=279, Invalid=777, Unknown=0, NotChecked=0, Total=1056 [2024-11-03 08:01:36,282 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 119 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 63 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.2s IncrementalHoareTripleChecker+Time [2024-11-03 08:01:36,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 515 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 652 Invalid, 9 Unknown, 0 Unchecked, 48.2s Time] [2024-11-03 08:01:36,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-03 08:01:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 237. [2024-11-03 08:01:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 144 states have (on average 1.2152777777777777) internal successors, (175), 144 states have internal predecessors, (175), 80 states have call successors, (80), 12 states have call predecessors, (80), 12 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-03 08:01:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 335 transitions. [2024-11-03 08:01:36,323 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 335 transitions. Word has length 251 [2024-11-03 08:01:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:01:36,324 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 335 transitions. [2024-11-03 08:01:36,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 6 states have call successors, (68), 5 states have call predecessors, (68), 8 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-03 08:01:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 335 transitions. [2024-11-03 08:01:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-03 08:01:36,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:01:36,327 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 08:01:36,350 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-03 08:01:36,531 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-03 08:01:36,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:01:36,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:01:36,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1994526730, now seen corresponding path program 1 times [2024-11-03 08:01:36,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:01:36,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1852881651] [2024-11-03 08:01:36,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:01:36,533 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-03 08:01:36,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:01:36,534 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-03 08:01:36,536 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-03 08:01:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:01:36,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-03 08:01:36,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:01:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2136 proven. 315 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2024-11-03 08:01:57,064 INFO L311 TraceCheckSpWp]: Computing backward predicates...