/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-22.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-05 23:15:52,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 23:15:52,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 23:15:52,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 23:15:52,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 23:15:52,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 23:15:52,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 23:15:52,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 23:15:52,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 23:15:52,882 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 23:15:52,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 23:15:52,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 23:15:52,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 23:15:52,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 23:15:52,883 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 23:15:52,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 23:15:52,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 23:15:52,883 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 23:15:52,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 23:15:52,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 23:15:52,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 23:15:52,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 23:15:52,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 23:15:52,886 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 23:15:52,886 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 23:15:52,887 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 23:15:52,887 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 23:15:52,887 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 23:15:52,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 23:15:52,887 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 23:15:52,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 23:15:52,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 23:15:52,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 23:15:52,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 23:15:52,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:15:52,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 23:15:52,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 23:15:52,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 23:15:52,889 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 23:15:52,889 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 23:15:52,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 23:15:52,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 23:15:52,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 23:15:52,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 23:15:52,891 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-05 23:15:53,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 23:15:53,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 23:15:53,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 23:15:53,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 23:15:53,116 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 23:15:53,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2024-11-05 23:15:54,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 23:15:54,625 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 23:15:54,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2024-11-05 23:15:54,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df61942d9/206fa1f4f45040cbba9e3791370375c5/FLAG89dda8dd3 [2024-11-05 23:15:55,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df61942d9/206fa1f4f45040cbba9e3791370375c5 [2024-11-05 23:15:55,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 23:15:55,037 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 23:15:55,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 23:15:55,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 23:15:55,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 23:15:55,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:15:55" (1/1) ... [2024-11-05 23:15:55,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de1f831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55, skipping insertion in model container [2024-11-05 23:15:55,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:15:55" (1/1) ... [2024-11-05 23:15:55,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 23:15:55,165 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_amount10_file-22.i[915,928] [2024-11-05 23:15:55,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:15:55,195 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 23:15:55,204 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_amount10_file-22.i[915,928] [2024-11-05 23:15:55,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:15:55,225 INFO L204 MainTranslator]: Completed translation [2024-11-05 23:15:55,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55 WrapperNode [2024-11-05 23:15:55,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 23:15:55,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 23:15:55,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 23:15:55,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 23:15:55,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55" (1/1) ... [2024-11-05 23:15:55,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55" (1/1) ... [2024-11-05 23:15:55,253 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 62 [2024-11-05 23:15:55,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 23:15:55,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 23:15:55,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 23:15:55,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 23:15:55,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55" (1/1) ... [2024-11-05 23:15:55,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55" (1/1) ... [2024-11-05 23:15:55,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55" (1/1) ... [2024-11-05 23:15:55,274 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-05 23:15:55,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55" (1/1) ... [2024-11-05 23:15:55,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55" (1/1) ... [2024-11-05 23:15:55,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55" (1/1) ... [2024-11-05 23:15:55,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55" (1/1) ... [2024-11-05 23:15:55,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55" (1/1) ... [2024-11-05 23:15:55,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55" (1/1) ... [2024-11-05 23:15:55,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 23:15:55,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 23:15:55,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 23:15:55,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 23:15:55,297 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55" (1/1) ... [2024-11-05 23:15:55,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:15:55,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 23:15:55,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 23:15:55,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 23:15:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 23:15:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 23:15:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 23:15:55,353 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 23:15:55,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 23:15:55,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 23:15:55,407 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 23:15:55,409 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 23:15:55,704 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-05 23:15:55,704 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 23:15:55,713 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 23:15:55,714 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 23:15:55,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:15:55 BoogieIcfgContainer [2024-11-05 23:15:55,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 23:15:55,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 23:15:55,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 23:15:55,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 23:15:55,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 11:15:55" (1/3) ... [2024-11-05 23:15:55,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605f4323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:15:55, skipping insertion in model container [2024-11-05 23:15:55,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:15:55" (2/3) ... [2024-11-05 23:15:55,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605f4323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:15:55, skipping insertion in model container [2024-11-05 23:15:55,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:15:55" (3/3) ... [2024-11-05 23:15:55,726 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-22.i [2024-11-05 23:15:55,739 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 23:15:55,739 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 23:15:55,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 23:15:55,786 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;@4dda7e9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 23:15:55,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 23:15:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 23:15:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-05 23:15:55,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:15:55,798 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:15:55,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:15:55,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:15:55,804 INFO L85 PathProgramCache]: Analyzing trace with hash -706627639, now seen corresponding path program 1 times [2024-11-05 23:15:55,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:15:55,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207615640] [2024-11-05 23:15:55,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:15:55,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:15:55,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:15:55,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 23:15:55,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 23:15:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:15:55,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 23:15:55,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:15:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-05 23:15:56,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:15:56,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:15:56,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207615640] [2024-11-05 23:15:56,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207615640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:15:56,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:15:56,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-05 23:15:56,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219634580] [2024-11-05 23:15:56,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:15:56,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 23:15:56,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:15:56,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 23:15:56,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 23:15:56,040 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-05 23:15:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:15:56,053 INFO L93 Difference]: Finished difference Result 55 states and 81 transitions. [2024-11-05 23:15:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 23:15:56,055 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2024-11-05 23:15:56,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:15:56,059 INFO L225 Difference]: With dead ends: 55 [2024-11-05 23:15:56,060 INFO L226 Difference]: Without dead ends: 27 [2024-11-05 23:15:56,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 23:15:56,064 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 23:15:56,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 23:15:56,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-05 23:15:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-05 23:15:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 23:15:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-05 23:15:56,090 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 40 [2024-11-05 23:15:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:15:56,091 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-05 23:15:56,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-05 23:15:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-05 23:15:56,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-05 23:15:56,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:15:56,093 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:15:56,099 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 23:15:56,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:15:56,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:15:56,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:15:56,295 INFO L85 PathProgramCache]: Analyzing trace with hash -51026809, now seen corresponding path program 1 times [2024-11-05 23:15:56,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:15:56,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844603521] [2024-11-05 23:15:56,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:15:56,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:15:56,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:15:56,299 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 23:15:56,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 23:15:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:15:56,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 23:15:56,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:15:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 23:15:56,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:15:56,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:15:56,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844603521] [2024-11-05 23:15:56,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844603521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:15:56,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:15:56,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-05 23:15:56,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317083973] [2024-11-05 23:15:56,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:15:56,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 23:15:56,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:15:56,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 23:15:56,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 23:15:56,697 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 23:15:56,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:15:56,953 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2024-11-05 23:15:56,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 23:15:56,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2024-11-05 23:15:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:15:56,960 INFO L225 Difference]: With dead ends: 75 [2024-11-05 23:15:56,960 INFO L226 Difference]: Without dead ends: 51 [2024-11-05 23:15:56,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 23:15:56,961 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 23:15:56,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 53 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 23:15:56,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-05 23:15:56,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-11-05 23:15:56,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 23:15:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-05 23:15:56,974 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 40 [2024-11-05 23:15:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:15:56,974 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-05 23:15:56,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 23:15:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-11-05 23:15:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-05 23:15:56,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:15:56,975 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:15:56,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-05 23:15:57,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:15:57,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:15:57,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:15:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash -49179767, now seen corresponding path program 1 times [2024-11-05 23:15:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:15:57,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050791265] [2024-11-05 23:15:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:15:57,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:15:57,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:15:57,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 23:15:57,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 23:15:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:15:57,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 23:15:57,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:15:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 23:15:57,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:15:57,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:15:57,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050791265] [2024-11-05 23:15:57,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050791265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:15:57,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:15:57,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-05 23:15:57,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765282453] [2024-11-05 23:15:57,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:15:57,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 23:15:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:15:57,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 23:15:57,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 23:15:57,878 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 23:15:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:15:58,349 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-11-05 23:15:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 23:15:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2024-11-05 23:15:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:15:58,351 INFO L225 Difference]: With dead ends: 60 [2024-11-05 23:15:58,351 INFO L226 Difference]: Without dead ends: 58 [2024-11-05 23:15:58,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-05 23:15:58,352 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 23:15:58,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 110 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 23:15:58,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-05 23:15:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2024-11-05 23:15:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 23:15:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2024-11-05 23:15:58,359 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 40 [2024-11-05 23:15:58,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:15:58,359 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2024-11-05 23:15:58,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 23:15:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2024-11-05 23:15:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-05 23:15:58,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:15:58,360 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:15:58,373 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 23:15:58,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:15:58,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:15:58,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:15:58,565 INFO L85 PathProgramCache]: Analyzing trace with hash -294239510, now seen corresponding path program 1 times [2024-11-05 23:15:58,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:15:58,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295614274] [2024-11-05 23:15:58,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:15:58,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:15:58,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:15:58,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 23:15:58,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 23:15:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:15:58,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 23:15:58,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:15:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-05 23:15:58,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:15:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 23:15:58,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:15:58,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295614274] [2024-11-05 23:15:58,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295614274] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 23:15:58,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 23:15:58,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-05 23:15:58,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946760613] [2024-11-05 23:15:58,802 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 23:15:58,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 23:15:58,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:15:58,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 23:15:58,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 23:15:58,804 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 23:15:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:15:59,001 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2024-11-05 23:15:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 23:15:59,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 41 [2024-11-05 23:15:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:15:59,007 INFO L225 Difference]: With dead ends: 111 [2024-11-05 23:15:59,007 INFO L226 Difference]: Without dead ends: 61 [2024-11-05 23:15:59,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-05 23:15:59,008 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 23:15:59,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 58 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 23:15:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-05 23:15:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2024-11-05 23:15:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 23:15:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2024-11-05 23:15:59,015 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 41 [2024-11-05 23:15:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:15:59,016 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-11-05 23:15:59,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 23:15:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-11-05 23:15:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-05 23:15:59,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:15:59,017 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:15:59,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 23:15:59,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:15:59,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:15:59,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:15:59,218 INFO L85 PathProgramCache]: Analyzing trace with hash -353344854, now seen corresponding path program 1 times [2024-11-05 23:15:59,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:15:59,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119356342] [2024-11-05 23:15:59,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:15:59,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:15:59,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:15:59,221 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 23:15:59,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-05 23:15:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:15:59,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-05 23:15:59,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:16:00,671 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 23:16:00,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:16:00,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:16:00,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119356342] [2024-11-05 23:16:00,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119356342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:16:00,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:16:00,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-05 23:16:00,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885419240] [2024-11-05 23:16:00,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:16:00,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 23:16:00,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:16:00,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 23:16:00,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-05 23:16:00,673 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 23:16:01,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:16:01,743 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2024-11-05 23:16:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-05 23:16:01,750 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2024-11-05 23:16:01,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:16:01,751 INFO L225 Difference]: With dead ends: 108 [2024-11-05 23:16:01,751 INFO L226 Difference]: Without dead ends: 106 [2024-11-05 23:16:01,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2024-11-05 23:16:01,752 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-05 23:16:01,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 174 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-05 23:16:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-05 23:16:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2024-11-05 23:16:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.087719298245614) internal successors, (62), 58 states have internal predecessors, (62), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-05 23:16:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-11-05 23:16:01,771 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 41 [2024-11-05 23:16:01,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:16:01,772 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-11-05 23:16:01,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 23:16:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-11-05 23:16:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-05 23:16:01,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:16:01,773 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:16:01,782 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 23:16:01,974 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 23:16:01,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:16:01,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:16:01,975 INFO L85 PathProgramCache]: Analyzing trace with hash -351497812, now seen corresponding path program 1 times [2024-11-05 23:16:01,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:16:01,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600339267] [2024-11-05 23:16:01,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:16:01,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:16:01,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:16:01,979 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 23:16:01,980 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 23:16:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:16:02,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 23:16:02,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:16:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-05 23:16:03,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:16:08,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:16:08,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600339267] [2024-11-05 23:16:08,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600339267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-05 23:16:08,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1180049331] [2024-11-05 23:16:08,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:16:08,974 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-05 23:16:08,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-05 23:16:08,995 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 23:16:08,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-05 23:16:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:16:09,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-05 23:16:09,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:16:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 23:16:14,548 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:16:14,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1180049331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:16:14,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 23:16:14,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 18 [2024-11-05 23:16:14,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469256865] [2024-11-05 23:16:14,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:16:14,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 23:16:14,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:16:14,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 23:16:14,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2024-11-05 23:16:14,550 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 23:16:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:16:18,953 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-11-05 23:16:18,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 23:16:18,954 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2024-11-05 23:16:18,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:16:18,958 INFO L225 Difference]: With dead ends: 88 [2024-11-05 23:16:18,958 INFO L226 Difference]: Without dead ends: 86 [2024-11-05 23:16:18,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2024-11-05 23:16:18,959 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-05 23:16:18,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 157 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-05 23:16:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-05 23:16:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2024-11-05 23:16:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-05 23:16:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-11-05 23:16:18,967 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 41 [2024-11-05 23:16:18,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:16:18,967 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-11-05 23:16:18,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 23:16:18,968 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-11-05 23:16:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-05 23:16:18,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:16:18,970 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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 23:16:18,978 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 (7)] Ended with exit code 0 [2024-11-05 23:16:19,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-05 23:16:19,371 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-05 23:16:19,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:16:19,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:16:19,372 INFO L85 PathProgramCache]: Analyzing trace with hash -102877155, now seen corresponding path program 1 times [2024-11-05 23:16:19,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:16:19,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135049560] [2024-11-05 23:16:19,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:16:19,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:16:19,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:16:19,374 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 23:16:19,375 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 23:16:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:16:19,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 23:16:19,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:16:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-05 23:16:20,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:16:20,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:16:20,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135049560] [2024-11-05 23:16:20,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135049560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:16:20,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:16:20,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-05 23:16:20,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353704102] [2024-11-05 23:16:20,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:16:20,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 23:16:20,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:16:20,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 23:16:20,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 23:16:20,251 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 23:16:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:16:20,776 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2024-11-05 23:16:20,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 23:16:20,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 78 [2024-11-05 23:16:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:16:20,778 INFO L225 Difference]: With dead ends: 92 [2024-11-05 23:16:20,778 INFO L226 Difference]: Without dead ends: 90 [2024-11-05 23:16:20,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-05 23:16:20,779 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 23:16:20,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 135 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 23:16:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-05 23:16:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2024-11-05 23:16:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-05 23:16:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-11-05 23:16:20,794 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 78 [2024-11-05 23:16:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:16:20,795 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-11-05 23:16:20,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 23:16:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-11-05 23:16:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-05 23:16:20,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:16:20,801 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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 23:16:20,809 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 (9)] Ended with exit code 0 [2024-11-05 23:16:21,005 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 23:16:21,005 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:16:21,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:16:21,006 INFO L85 PathProgramCache]: Analyzing trace with hash -101030113, now seen corresponding path program 1 times [2024-11-05 23:16:21,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:16:21,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54240601] [2024-11-05 23:16:21,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:16:21,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:16:21,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:16:21,018 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 23:16:21,025 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 (10)] Waiting until timeout for monitored process [2024-11-05 23:16:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:16:21,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 23:16:21,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:16:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-05 23:16:23,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:16:23,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:16:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54240601] [2024-11-05 23:16:23,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54240601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:16:23,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:16:23,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-05 23:16:23,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520574578] [2024-11-05 23:16:23,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:16:23,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 23:16:23,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:16:23,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 23:16:23,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 23:16:23,769 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-05 23:16:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:16:24,395 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2024-11-05 23:16:24,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 23:16:24,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 78 [2024-11-05 23:16:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:16:24,401 INFO L225 Difference]: With dead ends: 156 [2024-11-05 23:16:24,401 INFO L226 Difference]: Without dead ends: 109 [2024-11-05 23:16:24,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 23:16:24,402 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-05 23:16:24,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-05 23:16:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-05 23:16:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-05 23:16:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.0740740740740742) internal successors, (87), 82 states have internal predecessors, (87), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-05 23:16:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2024-11-05 23:16:24,420 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 78 [2024-11-05 23:16:24,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:16:24,420 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2024-11-05 23:16:24,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-05 23:16:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2024-11-05 23:16:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-05 23:16:24,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:16:24,422 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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 23:16:24,438 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 (10)] Forceful destruction successful, exit code 0 [2024-11-05 23:16:24,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:16:24,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:16:24,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:16:24,623 INFO L85 PathProgramCache]: Analyzing trace with hash 147116381, now seen corresponding path program 1 times [2024-11-05 23:16:24,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:16:24,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876919585] [2024-11-05 23:16:24,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:16:24,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:16:24,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:16:24,626 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 23:16:24,628 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 (11)] Waiting until timeout for monitored process [2024-11-05 23:16:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:16:24,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 23:16:24,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:16:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 114 proven. 2 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-05 23:16:29,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:16:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-05 23:16:31,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:16:31,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876919585] [2024-11-05 23:16:31,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876919585] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 23:16:31,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 23:16:31,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-05 23:16:31,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650902923] [2024-11-05 23:16:31,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 23:16:31,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 23:16:31,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:16:31,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 23:16:31,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-05 23:16:31,565 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 23:16:34,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:16:34,757 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2024-11-05 23:16:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 23:16:34,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 78 [2024-11-05 23:16:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:16:34,761 INFO L225 Difference]: With dead ends: 186 [2024-11-05 23:16:34,761 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 23:16:34,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-05 23:16:34,762 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-05 23:16:34,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 121 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-05 23:16:34,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 23:16:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 23:16:34,763 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 23:16:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 23:16:34,763 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2024-11-05 23:16:34,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:16:34,763 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 23:16:34,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 23:16:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 23:16:34,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 23:16:34,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 23:16:34,775 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 (11)] Ended with exit code 0 [2024-11-05 23:16:34,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:16:34,972 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:16:34,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 23:16:44,881 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 23:16:44,900 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,900 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,900 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,901 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,901 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,901 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 23:16:44,910 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,910 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 23:16:44,911 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,911 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,911 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,911 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,911 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,911 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 23:16:44,911 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,911 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 23:16:44,912 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,912 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,912 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,912 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,912 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:16:44,912 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 23:16:44,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 11:16:44 BoogieIcfgContainer [2024-11-05 23:16:44,917 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 23:16:44,918 INFO L158 Benchmark]: Toolchain (without parser) took 49881.37ms. Allocated memory was 348.1MB in the beginning and 435.2MB in the end (delta: 87.0MB). Free memory was 293.6MB in the beginning and 215.3MB in the end (delta: 78.3MB). Peak memory consumption was 166.4MB. Max. memory is 8.0GB. [2024-11-05 23:16:44,918 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 211.8MB. Free memory is still 159.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 23:16:44,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.00ms. Allocated memory is still 348.1MB. Free memory was 293.6MB in the beginning and 280.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-05 23:16:44,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.79ms. Allocated memory is still 348.1MB. Free memory was 280.0MB in the beginning and 278.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 23:16:44,918 INFO L158 Benchmark]: Boogie Preprocessor took 41.71ms. Allocated memory is still 348.1MB. Free memory was 277.9MB in the beginning and 275.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 23:16:44,919 INFO L158 Benchmark]: RCFGBuilder took 417.48ms. Allocated memory is still 348.1MB. Free memory was 275.8MB in the beginning and 262.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-05 23:16:44,919 INFO L158 Benchmark]: TraceAbstraction took 49196.94ms. Allocated memory was 348.1MB in the beginning and 435.2MB in the end (delta: 87.0MB). Free memory was 262.1MB in the beginning and 215.3MB in the end (delta: 46.9MB). Peak memory consumption was 134.9MB. Max. memory is 8.0GB. [2024-11-05 23:16:44,923 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.11ms. Allocated memory is still 211.8MB. Free memory is still 159.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.00ms. Allocated memory is still 348.1MB. Free memory was 293.6MB in the beginning and 280.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.79ms. Allocated memory is still 348.1MB. Free memory was 280.0MB in the beginning and 278.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.71ms. Allocated memory is still 348.1MB. Free memory was 277.9MB in the beginning and 275.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 417.48ms. Allocated memory is still 348.1MB. Free memory was 275.8MB in the beginning and 262.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 49196.94ms. Allocated memory was 348.1MB in the beginning and 435.2MB in the end (delta: 87.0MB). Free memory was 262.1MB in the beginning and 215.3MB in the end (delta: 46.9MB). Peak memory consumption was 134.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.2s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 922 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 629 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 577 IncrementalHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 293 mSDtfsCounter, 577 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 582 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=8, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 61 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 24.5s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 625 ConstructedInterpolants, 0 QuantifiedInterpolants, 2954 SizeOfPredicates, 51 NumberOfNonLiveVariables, 876 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 1085/1104 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: 60]: Loop Invariant Derived loop invariant: (var_1_3 <= 0) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6)))) RESULT: Ultimate proved your program to be correct! [2024-11-05 23:16:45,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...