/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_amount25_file-39.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 19:54:43,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 19:54:43,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 19:54:43,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 19:54:43,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 19:54:43,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 19:54:43,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 19:54:43,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 19:54:43,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 19:54:43,146 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 19:54:43,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 19:54:43,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 19:54:43,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 19:54:43,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 19:54:43,148 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 19:54:43,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 19:54:43,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 19:54:43,149 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 19:54:43,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 19:54:43,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 19:54:43,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 19:54:43,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 19:54:43,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 19:54:43,153 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 19:54:43,153 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 19:54:43,153 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 19:54:43,153 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 19:54:43,153 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 19:54:43,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 19:54:43,154 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 19:54:43,154 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 19:54:43,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 19:54:43,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 19:54:43,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 19:54:43,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:54:43,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 19:54:43,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 19:54:43,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 19:54:43,155 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 19:54:43,155 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 19:54:43,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 19:54:43,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 19:54:43,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 19:54:43,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 19:54:43,156 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-05 19:54:43,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 19:54:43,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 19:54:43,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 19:54:43,345 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 19:54:43,346 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 19:54:43,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-39.i [2024-11-05 19:54:44,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 19:54:44,744 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 19:54:44,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-39.i [2024-11-05 19:54:44,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da612d9ab/3200da9a8f7d44c286c2fd01a21e855e/FLAGe0826729d [2024-11-05 19:54:45,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da612d9ab/3200da9a8f7d44c286c2fd01a21e855e [2024-11-05 19:54:45,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 19:54:45,136 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 19:54:45,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 19:54:45,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 19:54:45,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 19:54:45,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:54:45" (1/1) ... [2024-11-05 19:54:45,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@658a9e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45, skipping insertion in model container [2024-11-05 19:54:45,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:54:45" (1/1) ... [2024-11-05 19:54:45,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 19:54:45,283 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_amount25_file-39.i[915,928] [2024-11-05 19:54:45,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:54:45,323 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 19:54:45,331 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_amount25_file-39.i[915,928] [2024-11-05 19:54:45,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:54:45,357 INFO L204 MainTranslator]: Completed translation [2024-11-05 19:54:45,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45 WrapperNode [2024-11-05 19:54:45,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 19:54:45,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 19:54:45,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 19:54:45,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 19:54:45,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45" (1/1) ... [2024-11-05 19:54:45,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45" (1/1) ... [2024-11-05 19:54:45,390 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-11-05 19:54:45,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 19:54:45,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 19:54:45,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 19:54:45,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 19:54:45,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45" (1/1) ... [2024-11-05 19:54:45,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45" (1/1) ... [2024-11-05 19:54:45,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45" (1/1) ... [2024-11-05 19:54:45,414 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-05 19:54:45,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45" (1/1) ... [2024-11-05 19:54:45,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45" (1/1) ... [2024-11-05 19:54:45,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45" (1/1) ... [2024-11-05 19:54:45,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45" (1/1) ... [2024-11-05 19:54:45,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45" (1/1) ... [2024-11-05 19:54:45,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45" (1/1) ... [2024-11-05 19:54:45,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 19:54:45,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 19:54:45,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 19:54:45,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 19:54:45,432 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45" (1/1) ... [2024-11-05 19:54:45,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:54:45,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 19:54:45,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 19:54:45,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 19:54:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 19:54:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 19:54:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 19:54:45,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 19:54:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 19:54:45,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 19:54:45,555 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 19:54:45,557 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 19:54:45,791 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-05 19:54:45,792 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 19:54:45,802 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 19:54:45,802 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 19:54:45,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:54:45 BoogieIcfgContainer [2024-11-05 19:54:45,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 19:54:45,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 19:54:45,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 19:54:45,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 19:54:45,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 07:54:45" (1/3) ... [2024-11-05 19:54:45,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bea356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:54:45, skipping insertion in model container [2024-11-05 19:54:45,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:54:45" (2/3) ... [2024-11-05 19:54:45,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bea356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:54:45, skipping insertion in model container [2024-11-05 19:54:45,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:54:45" (3/3) ... [2024-11-05 19:54:45,809 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-39.i [2024-11-05 19:54:45,820 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 19:54:45,820 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 19:54:45,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 19:54:45,862 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;@1a90ef8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 19:54:45,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 19:54:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-05 19:54:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-05 19:54:45,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:54:45,872 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:54:45,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:54:45,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:54:45,875 INFO L85 PathProgramCache]: Analyzing trace with hash 705531536, now seen corresponding path program 1 times [2024-11-05 19:54:45,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:54:45,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [749213382] [2024-11-05 19:54:45,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:54:45,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:54:45,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:54:45,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:54:45,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 19:54:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:54:46,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 19:54:46,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:54:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-05 19:54:46,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:54:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-05 19:54:46,507 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:54:46,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [749213382] [2024-11-05 19:54:46,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [749213382] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:54:46,509 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:54:46,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2024-11-05 19:54:46,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046553427] [2024-11-05 19:54:46,512 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:54:46,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 19:54:46,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:54:46,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 19:54:46,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 19:54:46,537 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-05 19:54:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:54:46,991 INFO L93 Difference]: Finished difference Result 195 states and 345 transitions. [2024-11-05 19:54:46,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 19:54:46,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 87 [2024-11-05 19:54:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:54:47,000 INFO L225 Difference]: With dead ends: 195 [2024-11-05 19:54:47,001 INFO L226 Difference]: Without dead ends: 151 [2024-11-05 19:54:47,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-05 19:54:47,006 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 151 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 19:54:47,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 302 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 19:54:47,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-05 19:54:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 81. [2024-11-05 19:54:47,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-05 19:54:47,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-11-05 19:54:47,055 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 87 [2024-11-05 19:54:47,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:54:47,055 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-11-05 19:54:47,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-05 19:54:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-05 19:54:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-05 19:54:47,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:54:47,060 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:54:47,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-05 19:54:47,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:54:47,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:54:47,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:54:47,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1626825182, now seen corresponding path program 1 times [2024-11-05 19:54:47,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:54:47,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1740871287] [2024-11-05 19:54:47,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:54:47,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:54:47,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:54:47,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:54:47,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 19:54:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:54:47,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-05 19:54:47,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:54:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-05 19:54:50,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:54:51,488 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-05 19:54:51,488 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:54:51,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1740871287] [2024-11-05 19:54:51,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1740871287] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:54:51,489 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:54:51,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 12 [2024-11-05 19:54:51,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856568593] [2024-11-05 19:54:51,489 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:54:51,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 19:54:51,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:54:51,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 19:54:51,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-05 19:54:51,493 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-05 19:54:52,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:54:52,337 INFO L93 Difference]: Finished difference Result 261 states and 366 transitions. [2024-11-05 19:54:52,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 19:54:52,338 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 88 [2024-11-05 19:54:52,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:54:52,340 INFO L225 Difference]: With dead ends: 261 [2024-11-05 19:54:52,340 INFO L226 Difference]: Without dead ends: 183 [2024-11-05 19:54:52,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-11-05 19:54:52,341 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 107 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-05 19:54:52,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 517 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-05 19:54:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-05 19:54:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 134. [2024-11-05 19:54:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.2087912087912087) internal successors, (110), 91 states have internal predecessors, (110), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-05 19:54:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 188 transitions. [2024-11-05 19:54:52,362 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 188 transitions. Word has length 88 [2024-11-05 19:54:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:54:52,362 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 188 transitions. [2024-11-05 19:54:52,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-05 19:54:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 188 transitions. [2024-11-05 19:54:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-05 19:54:52,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:54:52,363 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:54:52,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 19:54:52,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:54:52,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:54:52,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:54:52,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1628672224, now seen corresponding path program 1 times [2024-11-05 19:54:52,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:54:52,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1799344662] [2024-11-05 19:54:52,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:54:52,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:54:52,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:54:52,570 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:54:52,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 19:54:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:54:52,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-05 19:54:52,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:54:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-05 19:54:53,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:54:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-05 19:54:54,857 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:54:54,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1799344662] [2024-11-05 19:54:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1799344662] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:54:54,857 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:54:54,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 10] imperfect sequences [] total 17 [2024-11-05 19:54:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145934269] [2024-11-05 19:54:54,857 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:54:54,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-05 19:54:54,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:54:54,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-05 19:54:54,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-11-05 19:54:54,859 INFO L87 Difference]: Start difference. First operand 134 states and 188 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-05 19:54:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:54:56,285 INFO L93 Difference]: Finished difference Result 185 states and 252 transitions. [2024-11-05 19:54:56,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 19:54:56,286 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 88 [2024-11-05 19:54:56,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:54:56,287 INFO L225 Difference]: With dead ends: 185 [2024-11-05 19:54:56,287 INFO L226 Difference]: Without dead ends: 183 [2024-11-05 19:54:56,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2024-11-05 19:54:56,288 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 94 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-05 19:54:56,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 718 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-05 19:54:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-05 19:54:56,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 164. [2024-11-05 19:54:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.169811320754717) internal successors, (124), 107 states have internal predecessors, (124), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-05 19:54:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 228 transitions. [2024-11-05 19:54:56,310 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 228 transitions. Word has length 88 [2024-11-05 19:54:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:54:56,310 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 228 transitions. [2024-11-05 19:54:56,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-05 19:54:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 228 transitions. [2024-11-05 19:54:56,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-05 19:54:56,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:54:56,313 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:54:56,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 19:54:56,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:54:56,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:54:56,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:54:56,517 INFO L85 PathProgramCache]: Analyzing trace with hash -755537303, now seen corresponding path program 1 times [2024-11-05 19:54:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:54:56,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1708346209] [2024-11-05 19:54:56,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:54:56,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:54:56,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:54:56,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:54:56,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 19:54:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:54:56,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 19:54:56,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:54:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2024-11-05 19:54:58,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:54:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2024-11-05 19:54:59,433 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:54:59,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1708346209] [2024-11-05 19:54:59,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1708346209] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:54:59,436 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:54:59,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2024-11-05 19:54:59,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997318946] [2024-11-05 19:54:59,436 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:54:59,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-05 19:54:59,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:54:59,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-05 19:54:59,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-05 19:54:59,438 INFO L87 Difference]: Start difference. First operand 164 states and 228 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-05 19:54:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:54:59,920 INFO L93 Difference]: Finished difference Result 223 states and 306 transitions. [2024-11-05 19:54:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 19:54:59,920 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 173 [2024-11-05 19:54:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:54:59,923 INFO L225 Difference]: With dead ends: 223 [2024-11-05 19:54:59,923 INFO L226 Difference]: Without dead ends: 221 [2024-11-05 19:54:59,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 334 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-05 19:54:59,924 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 91 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 19:54:59,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 480 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 19:54:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-05 19:54:59,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2024-11-05 19:54:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 139 states have (on average 1.158273381294964) internal successors, (161), 142 states have internal predecessors, (161), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-05 19:54:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 301 transitions. [2024-11-05 19:54:59,956 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 301 transitions. Word has length 173 [2024-11-05 19:54:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:54:59,956 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 301 transitions. [2024-11-05 19:54:59,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-05 19:54:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 301 transitions. [2024-11-05 19:54:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-05 19:54:59,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:54:59,962 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:54:59,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 19:55:00,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:55:00,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:55:00,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:55:00,164 INFO L85 PathProgramCache]: Analyzing trace with hash -753690261, now seen corresponding path program 1 times [2024-11-05 19:55:00,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:55:00,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [412262328] [2024-11-05 19:55:00,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:55:00,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:55:00,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:55:00,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:55:00,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-05 19:55:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:55:00,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 19:55:00,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:55:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 825 proven. 176 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-05 19:55:01,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:55:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 114 proven. 64 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2024-11-05 19:55:02,352 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:55:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [412262328] [2024-11-05 19:55:02,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [412262328] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:55:02,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:55:02,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2024-11-05 19:55:02,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616123294] [2024-11-05 19:55:02,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:55:02,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-05 19:55:02,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:55:02,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-05 19:55:02,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2024-11-05 19:55:02,354 INFO L87 Difference]: Start difference. First operand 217 states and 301 transitions. Second operand has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 23 states have internal predecessors, (75), 4 states have call successors, (42), 4 states have call predecessors, (42), 8 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2024-11-05 19:55:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:55:03,623 INFO L93 Difference]: Finished difference Result 257 states and 334 transitions. [2024-11-05 19:55:03,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-05 19:55:03,623 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 23 states have internal predecessors, (75), 4 states have call successors, (42), 4 states have call predecessors, (42), 8 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 173 [2024-11-05 19:55:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:55:03,625 INFO L225 Difference]: With dead ends: 257 [2024-11-05 19:55:03,626 INFO L226 Difference]: Without dead ends: 255 [2024-11-05 19:55:03,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 321 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2024-11-05 19:55:03,627 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-05 19:55:03,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 676 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-05 19:55:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-05 19:55:03,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2024-11-05 19:55:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 157 states have (on average 1.1337579617834395) internal successors, (178), 160 states have internal predecessors, (178), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-05 19:55:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 318 transitions. [2024-11-05 19:55:03,658 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 318 transitions. Word has length 173 [2024-11-05 19:55:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:55:03,658 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 318 transitions. [2024-11-05 19:55:03,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 23 states have internal predecessors, (75), 4 states have call successors, (42), 4 states have call predecessors, (42), 8 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2024-11-05 19:55:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 318 transitions. [2024-11-05 19:55:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-05 19:55:03,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:55:03,663 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:55:03,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-05 19:55:03,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:55:03,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:55:03,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:55:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1109662877, now seen corresponding path program 1 times [2024-11-05 19:55:03,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:55:03,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1049836913] [2024-11-05 19:55:03,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:55:03,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:55:03,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:55:03,867 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:55:03,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-05 19:55:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:55:04,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-05 19:55:04,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:55:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 732 proven. 68 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-11-05 19:55:05,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:55:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-05 19:55:07,123 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:55:07,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1049836913] [2024-11-05 19:55:07,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1049836913] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:55:07,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:55:07,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2024-11-05 19:55:07,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660000070] [2024-11-05 19:55:07,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:55:07,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 19:55:07,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:55:07,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 19:55:07,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2024-11-05 19:55:07,125 INFO L87 Difference]: Start difference. First operand 241 states and 318 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-05 19:55:07,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:55:07,911 INFO L93 Difference]: Finished difference Result 257 states and 335 transitions. [2024-11-05 19:55:07,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 19:55:07,911 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 174 [2024-11-05 19:55:07,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:55:07,913 INFO L225 Difference]: With dead ends: 257 [2024-11-05 19:55:07,913 INFO L226 Difference]: Without dead ends: 255 [2024-11-05 19:55:07,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2024-11-05 19:55:07,914 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 37 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 19:55:07,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 244 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 19:55:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-05 19:55:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2024-11-05 19:55:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 157 states have (on average 1.1337579617834395) internal successors, (178), 160 states have internal predecessors, (178), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-05 19:55:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 318 transitions. [2024-11-05 19:55:07,934 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 318 transitions. Word has length 174 [2024-11-05 19:55:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:55:07,935 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 318 transitions. [2024-11-05 19:55:07,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-05 19:55:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 318 transitions. [2024-11-05 19:55:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-05 19:55:07,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:55:07,937 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:55:07,944 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 (7)] Forceful destruction successful, exit code 0 [2024-11-05 19:55:08,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:55:08,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:55:08,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:55:08,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1107815835, now seen corresponding path program 1 times [2024-11-05 19:55:08,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:55:08,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [426780526] [2024-11-05 19:55:08,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:55:08,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:55:08,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:55:08,143 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:55:08,144 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 (8)] Waiting until timeout for monitored process [2024-11-05 19:55:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:55:08,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-05 19:55:08,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:55:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 834 proven. 230 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-05 19:55:09,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:55:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 180 proven. 134 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-05 19:55:13,603 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:55:13,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [426780526] [2024-11-05 19:55:13,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [426780526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:55:13,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:55:13,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2024-11-05 19:55:13,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96477139] [2024-11-05 19:55:13,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:55:13,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-05 19:55:13,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:55:13,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-05 19:55:13,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1534, Unknown=0, NotChecked=0, Total=1980 [2024-11-05 19:55:13,606 INFO L87 Difference]: Start difference. First operand 241 states and 318 transitions. Second operand has 45 states, 44 states have (on average 2.8636363636363638) internal successors, (126), 43 states have internal predecessors, (126), 12 states have call successors, (52), 7 states have call predecessors, (52), 13 states have return successors, (52), 10 states have call predecessors, (52), 12 states have call successors, (52) [2024-11-05 19:55:23,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:55:23,379 INFO L93 Difference]: Finished difference Result 470 states and 577 transitions. [2024-11-05 19:55:23,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-11-05 19:55:23,380 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.8636363636363638) internal successors, (126), 43 states have internal predecessors, (126), 12 states have call successors, (52), 7 states have call predecessors, (52), 13 states have return successors, (52), 10 states have call predecessors, (52), 12 states have call successors, (52) Word has length 174 [2024-11-05 19:55:23,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:55:23,382 INFO L225 Difference]: With dead ends: 470 [2024-11-05 19:55:23,382 INFO L226 Difference]: Without dead ends: 468 [2024-11-05 19:55:23,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3288, Invalid=10518, Unknown=0, NotChecked=0, Total=13806 [2024-11-05 19:55:23,386 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 788 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-05 19:55:23,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 880 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 2033 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-05 19:55:23,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-05 19:55:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 339. [2024-11-05 19:55:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 222 states have (on average 1.117117117117117) internal successors, (248), 226 states have internal predecessors, (248), 91 states have call successors, (91), 25 states have call predecessors, (91), 25 states have return successors, (91), 87 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-05 19:55:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 430 transitions. [2024-11-05 19:55:23,454 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 430 transitions. Word has length 174 [2024-11-05 19:55:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:55:23,454 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 430 transitions. [2024-11-05 19:55:23,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.8636363636363638) internal successors, (126), 43 states have internal predecessors, (126), 12 states have call successors, (52), 7 states have call predecessors, (52), 13 states have return successors, (52), 10 states have call predecessors, (52), 12 states have call successors, (52) [2024-11-05 19:55:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 430 transitions. [2024-11-05 19:55:23,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-05 19:55:23,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:55:23,458 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:55:23,468 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 (8)] Forceful destruction successful, exit code 0 [2024-11-05 19:55:23,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:55:23,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:55:23,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:55:23,660 INFO L85 PathProgramCache]: Analyzing trace with hash 304239104, now seen corresponding path program 1 times [2024-11-05 19:55:23,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:55:23,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1540993644] [2024-11-05 19:55:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:55:23,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:55:23,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:55:23,663 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:55:23,664 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 (9)] Waiting until timeout for monitored process [2024-11-05 19:55:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:55:23,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-05 19:55:23,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:55:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3059 backedges. 2042 proven. 437 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-05 19:55:25,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:55:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3059 backedges. 313 proven. 220 refuted. 0 times theorem prover too weak. 2526 trivial. 0 not checked. [2024-11-05 19:55:29,677 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:55:29,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1540993644] [2024-11-05 19:55:29,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1540993644] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:55:29,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:55:29,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2024-11-05 19:55:29,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541549302] [2024-11-05 19:55:29,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:55:29,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-05 19:55:29,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:55:29,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-05 19:55:29,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2024-11-05 19:55:29,680 INFO L87 Difference]: Start difference. First operand 339 states and 430 transitions. Second operand has 44 states, 43 states have (on average 3.0) internal successors, (129), 42 states have internal predecessors, (129), 11 states have call successors, (68), 7 states have call predecessors, (68), 13 states have return successors, (69), 9 states have call predecessors, (69), 11 states have call successors, (69) [2024-11-05 19:55:36,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:55:36,191 INFO L93 Difference]: Finished difference Result 891 states and 1093 transitions. [2024-11-05 19:55:36,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-05 19:55:36,192 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 3.0) internal successors, (129), 42 states have internal predecessors, (129), 11 states have call successors, (68), 7 states have call predecessors, (68), 13 states have return successors, (69), 9 states have call predecessors, (69), 11 states have call successors, (69) Word has length 258 [2024-11-05 19:55:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:55:36,193 INFO L225 Difference]: With dead ends: 891 [2024-11-05 19:55:36,193 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 19:55:36,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 473 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2848 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2401, Invalid=8105, Unknown=0, NotChecked=0, Total=10506 [2024-11-05 19:55:36,198 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 262 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 226 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-05 19:55:36,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 922 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1969 Invalid, 25 Unknown, 0 Unchecked, 3.2s Time] [2024-11-05 19:55:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 19:55:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 19:55:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 19:55:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 19:55:36,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 258 [2024-11-05 19:55:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:55:36,199 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 19:55:36,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.0) internal successors, (129), 42 states have internal predecessors, (129), 11 states have call successors, (68), 7 states have call predecessors, (68), 13 states have return successors, (69), 9 states have call predecessors, (69), 11 states have call successors, (69) [2024-11-05 19:55:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 19:55:36,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 19:55:36,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 19:55:36,211 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 (9)] Forceful destruction successful, exit code 0 [2024-11-05 19:55:36,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:55:36,405 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:55:36,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 19:55:50,255 WARN L286 SmtUtils]: Spent 11.02s on a formula simplification. DAG size of input: 1172 DAG size of output: 41 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-05 19:56:13,682 WARN L286 SmtUtils]: Spent 17.45s on a formula simplification. DAG size of input: 1053 DAG size of output: 45 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-05 19:56:22,352 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 19:56:22,360 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-05 19:56:22,361 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-05 19:56:22,373 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-05 19:56:22,373 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-05 19:56:22,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 07:56:22 BoogieIcfgContainer [2024-11-05 19:56:22,379 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 19:56:22,380 INFO L158 Benchmark]: Toolchain (without parser) took 97243.21ms. Allocated memory was 224.4MB in the beginning and 764.4MB in the end (delta: 540.0MB). Free memory was 188.1MB in the beginning and 331.4MB in the end (delta: -143.3MB). Peak memory consumption was 465.3MB. Max. memory is 8.0GB. [2024-11-05 19:56:22,380 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 224.4MB. Free memory is still 174.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 19:56:22,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.73ms. Allocated memory is still 224.4MB. Free memory was 188.1MB in the beginning and 173.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-05 19:56:22,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.82ms. Allocated memory is still 224.4MB. Free memory was 173.3MB in the beginning and 171.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 19:56:22,380 INFO L158 Benchmark]: Boogie Preprocessor took 40.21ms. Allocated memory is still 224.4MB. Free memory was 171.2MB in the beginning and 168.3MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-05 19:56:22,380 INFO L158 Benchmark]: RCFGBuilder took 370.84ms. Allocated memory is still 224.4MB. Free memory was 168.3MB in the beginning and 153.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-05 19:56:22,381 INFO L158 Benchmark]: TraceAbstraction took 96575.21ms. Allocated memory was 224.4MB in the beginning and 764.4MB in the end (delta: 540.0MB). Free memory was 153.0MB in the beginning and 331.4MB in the end (delta: -178.4MB). Peak memory consumption was 429.6MB. Max. memory is 8.0GB. [2024-11-05 19:56:22,382 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 224.4MB. Free memory is still 174.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.73ms. Allocated memory is still 224.4MB. Free memory was 188.1MB in the beginning and 173.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.82ms. Allocated memory is still 224.4MB. Free memory was 173.3MB in the beginning and 171.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.21ms. Allocated memory is still 224.4MB. Free memory was 171.2MB in the beginning and 168.3MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 370.84ms. Allocated memory is still 224.4MB. Free memory was 168.3MB in the beginning and 153.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 96575.21ms. Allocated memory was 224.4MB in the beginning and 764.4MB in the end (delta: 540.0MB). Free memory was 153.0MB in the beginning and 331.4MB in the end (delta: -178.4MB). Peak memory consumption was 429.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.6s, OverallIterations: 8, TraceHistogramMax: 39, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 25 mSolverCounterUnknown, 1682 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1642 mSDsluCounter, 4739 SdHoareTripleChecker+Invalid, 10.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4012 mSDsCounter, 1019 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6156 IncrementalHoareTripleChecker+Invalid, 7200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1019 mSolverCounterUnsat, 727 mSDtfsCounter, 6156 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2586 GetRequests, 2252 SyntacticMatches, 8 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8483 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=339occurred in iteration=7, InterpolantAutomatonStates: 226, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 299 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 25.9s InterpolantComputationTime, 1215 NumberOfCodeBlocks, 1215 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 2414 ConstructedInterpolants, 124 QuantifiedInterpolants, 23355 SizeOfPredicates, 137 NumberOfNonLiveVariables, 1863 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 17313/18642 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: (((((var_1_13 >= 1) && (1 == var_1_10)) || ((((((((var_1_1 == 6) && (var_1_13 >= 1)) && (10 == var_1_14)) && ((0 != \old(cond)) || (var_1_3 <= 16383))) && (last_1_var_1_10 == 0)) && (var_1_6 == 10)) && (((10 != -var_1_11) && (var_1_11 < 0)) || ((10 != var_1_11) && !(var_1_11 < 0)))) && (0 == var_1_10))) || (((((var_1_13 >= 1) && (10 == var_1_14)) && (10 >= var_1_1)) && (1 == var_1_10)) && (var_1_6 == 10))) || (((((var_1_3 >= last_1_var_1_6) && (10 == var_1_14)) && (last_1_var_1_10 == 0)) && (10 >= var_1_1)) && (0 == var_1_10))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((((((10 == var_1_14) && (last_1_var_1_10 == 0)) && (10 >= var_1_1)) && (0 == var_1_10)) || (((((((10 == var_1_14) && (var_1_3 >= 0)) && (var_1_3 <= 16383)) && (10 >= var_1_1)) && (1 == var_1_10)) && (var_1_6 == 10)) && (10 == last_1_var_1_6))) || (1 == var_1_10)) || ((((((var_1_13 >= 1) && (10 == var_1_14)) && (10 >= var_1_1)) && (1 == var_1_10)) && (var_1_6 == 10)) && (10 == last_1_var_1_6))) Ensures: (((0 != cond) && (((((((10 == var_1_14) && (last_1_var_1_10 == 0)) && (10 >= var_1_1)) && (0 == var_1_10)) || (((((((10 == var_1_14) && (var_1_3 >= 0)) && (var_1_3 <= 16383)) && (10 >= var_1_1)) && (1 == var_1_10)) && (var_1_6 == 10)) && (10 == last_1_var_1_6))) || (1 == var_1_10)) || ((((((var_1_13 >= 1) && (10 == var_1_14)) && (10 >= var_1_1)) && (1 == var_1_10)) && (var_1_6 == 10)) && (10 == last_1_var_1_6)))) && (((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_16 == \old(var_1_16))) && (last_1_var_1_6 == \old(last_1_var_1_6))) && (last_1_var_1_10 == \old(last_1_var_1_10)))) RESULT: Ultimate proved your program to be correct! [2024-11-05 19:56:22,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...