/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-65.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:22:41,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:22:41,556 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 20:22:41,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:22:41,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:22:41,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:22:41,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:22:41,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:22:41,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:22:41,583 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:22:41,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:22:41,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:22:41,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:22:41,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:22:41,587 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:22:41,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:22:41,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:22:41,588 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:22:41,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:22:41,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:22:41,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:22:41,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:22:41,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:22:41,591 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:22:41,591 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:22:41,591 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:22:41,591 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:22:41,591 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:22:41,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:22:41,591 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:22:41,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:22:41,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:22:41,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:22:41,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:22:41,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:22:41,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:22:41,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:22:41,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:22:41,593 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:22:41,593 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:22:41,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:22:41,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:22:41,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:22:41,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:22:41,594 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:22:41,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:22:41,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:22:41,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:22:41,785 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:22:41,785 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:22:41,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-65.i [2024-11-05 20:22:42,935 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:22:43,093 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:22:43,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-65.i [2024-11-05 20:22:43,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f6d2d83d/cbcb58fd86474b8bb01c7e7b5dd51459/FLAGcba48455a [2024-11-05 20:22:43,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f6d2d83d/cbcb58fd86474b8bb01c7e7b5dd51459 [2024-11-05 20:22:43,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:22:43,515 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:22:43,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:22:43,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:22:43,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:22:43,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:22:43" (1/1) ... [2024-11-05 20:22:43,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3bafae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43, skipping insertion in model container [2024-11-05 20:22:43,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:22:43" (1/1) ... [2024-11-05 20:22:43,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:22:43,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-65.i[915,928] [2024-11-05 20:22:43,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:22:43,745 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:22:43,754 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-65.i[915,928] [2024-11-05 20:22:43,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:22:43,807 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:22:43,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43 WrapperNode [2024-11-05 20:22:43,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:22:43,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:22:43,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:22:43,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:22:43,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43" (1/1) ... [2024-11-05 20:22:43,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43" (1/1) ... [2024-11-05 20:22:43,845 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2024-11-05 20:22:43,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:22:43,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:22:43,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:22:43,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:22:43,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43" (1/1) ... [2024-11-05 20:22:43,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43" (1/1) ... [2024-11-05 20:22:43,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43" (1/1) ... [2024-11-05 20:22:43,867 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 20:22:43,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43" (1/1) ... [2024-11-05 20:22:43,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43" (1/1) ... [2024-11-05 20:22:43,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43" (1/1) ... [2024-11-05 20:22:43,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43" (1/1) ... [2024-11-05 20:22:43,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43" (1/1) ... [2024-11-05 20:22:43,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43" (1/1) ... [2024-11-05 20:22:43,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:22:43,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:22:43,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:22:43,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:22:43,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43" (1/1) ... [2024-11-05 20:22:43,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:22:43,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:22:43,921 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 20:22:43,927 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 20:22:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:22:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:22:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 20:22:43,946 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 20:22:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:22:43,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:22:44,019 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:22:44,021 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:22:44,753 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-05 20:22:44,753 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:22:44,763 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:22:44,763 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 20:22:44,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:22:44 BoogieIcfgContainer [2024-11-05 20:22:44,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:22:44,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:22:44,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:22:44,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:22:44,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:22:43" (1/3) ... [2024-11-05 20:22:44,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a17af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:22:44, skipping insertion in model container [2024-11-05 20:22:44,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:22:43" (2/3) ... [2024-11-05 20:22:44,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a17af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:22:44, skipping insertion in model container [2024-11-05 20:22:44,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:22:44" (3/3) ... [2024-11-05 20:22:44,770 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-65.i [2024-11-05 20:22:44,781 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:22:44,781 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:22:44,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:22:44,824 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;@15914bf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:22:44,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:22:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-05 20:22:44,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-05 20:22:44,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:22:44,835 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:22:44,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:22:44,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:22:44,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1696586276, now seen corresponding path program 1 times [2024-11-05 20:22:44,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:22:44,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [414291135] [2024-11-05 20:22:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:22:44,845 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 20:22:44,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:22:44,848 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 20:22:44,849 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 20:22:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:22:45,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 20:22:45,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:22:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-05 20:22:45,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:22:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-05 20:22:45,205 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:22:45,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [414291135] [2024-11-05 20:22:45,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [414291135] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:22:45,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:22:45,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 20:22:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991732156] [2024-11-05 20:22:45,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:22:45,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 20:22:45,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:22:45,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 20:22:45,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 20:22:45,226 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-05 20:22:45,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:22:45,243 INFO L93 Difference]: Finished difference Result 109 states and 184 transitions. [2024-11-05 20:22:45,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 20:22:45,245 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 117 [2024-11-05 20:22:45,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:22:45,250 INFO L225 Difference]: With dead ends: 109 [2024-11-05 20:22:45,251 INFO L226 Difference]: Without dead ends: 54 [2024-11-05 20:22:45,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 232 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 20:22:45,257 INFO L432 NwaCegarLoop]: 78 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, 78 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 20:22:45,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:22:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-05 20:22:45,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-05 20:22:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-05 20:22:45,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-11-05 20:22:45,287 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 117 [2024-11-05 20:22:45,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:22:45,287 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-11-05 20:22:45,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-05 20:22:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-11-05 20:22:45,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-05 20:22:45,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:22:45,290 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:22:45,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 20:22:45,490 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 20:22:45,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:22:45,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:22:45,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1803614376, now seen corresponding path program 1 times [2024-11-05 20:22:45,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:22:45,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1410228639] [2024-11-05 20:22:45,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:22:45,492 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 20:22:45,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:22:45,493 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 20:22:45,494 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 20:22:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:22:45,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 20:22:45,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:22:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-05 20:22:46,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:22:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-05 20:22:47,221 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:22:47,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1410228639] [2024-11-05 20:22:47,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1410228639] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:22:47,221 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:22:47,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2024-11-05 20:22:47,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630886419] [2024-11-05 20:22:47,222 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:22:47,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:22:47,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:22:47,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:22:47,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:22:47,224 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-05 20:22:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:22:48,816 INFO L93 Difference]: Finished difference Result 174 states and 252 transitions. [2024-11-05 20:22:48,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:22:48,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 117 [2024-11-05 20:22:48,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:22:48,830 INFO L225 Difference]: With dead ends: 174 [2024-11-05 20:22:48,831 INFO L226 Difference]: Without dead ends: 123 [2024-11-05 20:22:48,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:22:48,833 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 90 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-05 20:22:48,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 281 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-05 20:22:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-05 20:22:48,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2024-11-05 20:22:48,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-05 20:22:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 130 transitions. [2024-11-05 20:22:48,861 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 130 transitions. Word has length 117 [2024-11-05 20:22:48,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:22:48,862 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 130 transitions. [2024-11-05 20:22:48,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-05 20:22:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 130 transitions. [2024-11-05 20:22:48,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-05 20:22:48,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:22:48,865 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:22:48,875 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 20:22:49,065 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 20:22:49,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:22:49,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:22:49,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1545448938, now seen corresponding path program 1 times [2024-11-05 20:22:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:22:49,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [285369333] [2024-11-05 20:22:49,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:22:49,067 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 20:22:49,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:22:49,068 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 20:22:49,069 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 20:22:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:22:49,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:22:49,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:22:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-05 20:22:49,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:22:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-05 20:22:49,576 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:22:49,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [285369333] [2024-11-05 20:22:49,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [285369333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:22:49,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:22:49,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-05 20:22:49,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532338010] [2024-11-05 20:22:49,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:22:49,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 20:22:49,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:22:49,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 20:22:49,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-05 20:22:49,579 INFO L87 Difference]: Start difference. First operand 89 states and 130 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-05 20:22:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:22:50,524 INFO L93 Difference]: Finished difference Result 154 states and 217 transitions. [2024-11-05 20:22:50,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 20:22:50,525 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 117 [2024-11-05 20:22:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:22:50,527 INFO L225 Difference]: With dead ends: 154 [2024-11-05 20:22:50,527 INFO L226 Difference]: Without dead ends: 103 [2024-11-05 20:22:50,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-05 20:22:50,528 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 113 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-05 20:22:50,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 136 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-05 20:22:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-05 20:22:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2024-11-05 20:22:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-05 20:22:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 135 transitions. [2024-11-05 20:22:50,541 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 135 transitions. Word has length 117 [2024-11-05 20:22:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:22:50,542 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 135 transitions. [2024-11-05 20:22:50,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-05 20:22:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 135 transitions. [2024-11-05 20:22:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-05 20:22:50,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:22:50,543 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:22:50,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 20:22:50,744 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 20:22:50,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:22:50,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:22:50,745 INFO L85 PathProgramCache]: Analyzing trace with hash 428716543, now seen corresponding path program 1 times [2024-11-05 20:22:50,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:22:50,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [399093359] [2024-11-05 20:22:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:22:50,745 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 20:22:50,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:22:50,748 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 20:22:50,749 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 20:22:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:22:50,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:22:50,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:22:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-05 20:22:50,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:22:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-05 20:22:51,129 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:22:51,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [399093359] [2024-11-05 20:22:51,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [399093359] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:22:51,129 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:22:51,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2024-11-05 20:22:51,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993084624] [2024-11-05 20:22:51,130 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:22:51,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:22:51,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:22:51,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:22:51,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:22:51,131 INFO L87 Difference]: Start difference. First operand 97 states and 135 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-05 20:22:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:22:52,365 INFO L93 Difference]: Finished difference Result 177 states and 238 transitions. [2024-11-05 20:22:52,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-05 20:22:52,366 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), 1 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 118 [2024-11-05 20:22:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:22:52,368 INFO L225 Difference]: With dead ends: 177 [2024-11-05 20:22:52,368 INFO L226 Difference]: Without dead ends: 122 [2024-11-05 20:22:52,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-05 20:22:52,369 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 96 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:22:52,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 244 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-05 20:22:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-05 20:22:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2024-11-05 20:22:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 62 states have (on average 1.096774193548387) internal successors, (68), 62 states have internal predecessors, (68), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-05 20:22:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 140 transitions. [2024-11-05 20:22:52,393 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 140 transitions. Word has length 118 [2024-11-05 20:22:52,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:22:52,394 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 140 transitions. [2024-11-05 20:22:52,394 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), 1 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-05 20:22:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 140 transitions. [2024-11-05 20:22:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-05 20:22:52,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:22:52,398 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:22:52,406 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 20:22:52,598 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 20:22:52,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:22:52,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:22:52,599 INFO L85 PathProgramCache]: Analyzing trace with hash 430563585, now seen corresponding path program 1 times [2024-11-05 20:22:52,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:22:52,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1426571806] [2024-11-05 20:22:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:22:52,600 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 20:22:52,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:22:52,602 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 20:22:52,603 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 20:22:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:22:52,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-05 20:22:52,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:23:11,005 WARN L286 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-05 20:23:26,005 WARN L286 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-05 20:23:45,674 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-05 20:24:05,762 WARN L286 SmtUtils]: Spent 7.74s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)