/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_floatingpointinfluence_no-floats_file-45.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 19:14:58,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 19:14:58,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 19:14:58,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 19:14:58,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 19:14:58,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 19:14:58,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 19:14:58,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 19:14:58,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 19:14:58,554 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 19:14:58,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 19:14:58,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 19:14:58,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 19:14:58,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 19:14:58,561 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 19:14:58,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 19:14:58,561 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 19:14:58,561 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 19:14:58,562 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 19:14:58,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 19:14:58,562 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 19:14:58,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 19:14:58,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 19:14:58,563 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 19:14:58,563 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 19:14:58,563 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 19:14:58,564 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 19:14:58,564 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 19:14:58,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 19:14:58,564 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 19:14:58,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 19:14:58,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 19:14:58,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 19:14:58,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 19:14:58,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:14:58,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 19:14:58,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 19:14:58,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 19:14:58,567 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 19:14:58,567 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 19:14:58,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 19:14:58,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 19:14:58,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 19:14:58,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 19:14:58,570 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:14:58,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 19:14:58,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 19:14:58,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 19:14:58,855 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 19:14:58,856 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 19:14:58,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i [2024-11-05 19:15:00,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 19:15:00,490 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 19:15:00,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i [2024-11-05 19:15:00,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57db10ca4/a69010dfb8664b2e9c5dea49019bbb92/FLAG632d727cf [2024-11-05 19:15:00,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57db10ca4/a69010dfb8664b2e9c5dea49019bbb92 [2024-11-05 19:15:00,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 19:15:00,524 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 19:15:00,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 19:15:00,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 19:15:00,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 19:15:00,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:15:00" (1/1) ... [2024-11-05 19:15:00,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a778060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00, skipping insertion in model container [2024-11-05 19:15:00,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:15:00" (1/1) ... [2024-11-05 19:15:00,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 19:15:00,730 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_floatingpointinfluence_no-floats_file-45.i[916,929] [2024-11-05 19:15:00,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:15:00,800 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 19:15:00,809 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_floatingpointinfluence_no-floats_file-45.i[916,929] [2024-11-05 19:15:00,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:15:00,854 INFO L204 MainTranslator]: Completed translation [2024-11-05 19:15:00,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00 WrapperNode [2024-11-05 19:15:00,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 19:15:00,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 19:15:00,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 19:15:00,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 19:15:00,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00" (1/1) ... [2024-11-05 19:15:00,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00" (1/1) ... [2024-11-05 19:15:00,903 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-11-05 19:15:00,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 19:15:00,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 19:15:00,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 19:15:00,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 19:15:00,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00" (1/1) ... [2024-11-05 19:15:00,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00" (1/1) ... [2024-11-05 19:15:00,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00" (1/1) ... [2024-11-05 19:15:00,940 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-05 19:15:00,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00" (1/1) ... [2024-11-05 19:15:00,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00" (1/1) ... [2024-11-05 19:15:00,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00" (1/1) ... [2024-11-05 19:15:00,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00" (1/1) ... [2024-11-05 19:15:00,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00" (1/1) ... [2024-11-05 19:15:00,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00" (1/1) ... [2024-11-05 19:15:00,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 19:15:00,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 19:15:00,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 19:15:00,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 19:15:00,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00" (1/1) ... [2024-11-05 19:15:00,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:15:00,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 19:15:01,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 19:15:01,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 19:15:01,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 19:15:01,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 19:15:01,036 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 19:15:01,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 19:15:01,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 19:15:01,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 19:15:01,108 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 19:15:01,110 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 19:15:06,945 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-05 19:15:06,945 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 19:15:06,960 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 19:15:06,960 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 19:15:06,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:15:06 BoogieIcfgContainer [2024-11-05 19:15:06,961 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 19:15:06,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 19:15:06,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 19:15:06,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 19:15:06,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 07:15:00" (1/3) ... [2024-11-05 19:15:06,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df115ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:15:06, skipping insertion in model container [2024-11-05 19:15:06,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:15:00" (2/3) ... [2024-11-05 19:15:06,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df115ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:15:06, skipping insertion in model container [2024-11-05 19:15:06,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:15:06" (3/3) ... [2024-11-05 19:15:06,971 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-45.i [2024-11-05 19:15:06,992 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 19:15:06,992 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 19:15:07,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 19:15:07,064 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;@305e76b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 19:15:07,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 19:15:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-05 19:15:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-05 19:15:07,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:15:07,087 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:15:07,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:15:07,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:15:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1441036521, now seen corresponding path program 1 times [2024-11-05 19:15:07,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:15:07,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [618841997] [2024-11-05 19:15:07,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:15:07,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:15:07,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:15:07,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:15:07,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 19:15:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:15:07,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 19:15:07,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:15:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-05 19:15:07,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:15:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2024-11-05 19:15:07,863 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:15:07,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [618841997] [2024-11-05 19:15:07,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [618841997] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:15:07,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:15:07,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 19:15:07,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605394227] [2024-11-05 19:15:07,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:15:07,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 19:15:07,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:15:07,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 19:15:07,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:15:07,899 INFO L87 Difference]: Start difference. First operand has 67 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-05 19:15:07,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:15:07,938 INFO L93 Difference]: Finished difference Result 127 states and 229 transitions. [2024-11-05 19:15:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 19:15:07,941 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 172 [2024-11-05 19:15:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:15:07,951 INFO L225 Difference]: With dead ends: 127 [2024-11-05 19:15:07,951 INFO L226 Difference]: Without dead ends: 63 [2024-11-05 19:15:07,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 342 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 19:15:07,958 INFO L432 NwaCegarLoop]: 95 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, 95 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 19:15:07,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 19:15:07,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-05 19:15:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-05 19:15:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-05 19:15:08,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-11-05 19:15:08,008 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 172 [2024-11-05 19:15:08,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:15:08,008 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-11-05 19:15:08,009 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-05 19:15:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-11-05 19:15:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-05 19:15:08,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:15:08,013 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:15:08,024 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 19:15:08,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:15:08,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:15:08,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:15:08,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1143112326, now seen corresponding path program 1 times [2024-11-05 19:15:08,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:15:08,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1169150808] [2024-11-05 19:15:08,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:15:08,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:15:08,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:15:08,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:15:08,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 19:15:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:15:08,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 19:15:08,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:15:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 899 proven. 69 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2024-11-05 19:15:09,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:15:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 93 proven. 72 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-11-05 19:15:10,145 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:15:10,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1169150808] [2024-11-05 19:15:10,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1169150808] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:15:10,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:15:10,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-05 19:15:10,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614810334] [2024-11-05 19:15:10,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:15:10,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-05 19:15:10,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:15:10,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-05 19:15:10,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-05 19:15:10,150 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-05 19:15:12,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:15:14,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:15:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:15:15,214 INFO L93 Difference]: Finished difference Result 211 states and 303 transitions. [2024-11-05 19:15:15,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-05 19:15:15,215 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 173 [2024-11-05 19:15:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:15:15,219 INFO L225 Difference]: With dead ends: 211 [2024-11-05 19:15:15,219 INFO L226 Difference]: Without dead ends: 151 [2024-11-05 19:15:15,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 334 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-11-05 19:15:15,223 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 117 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-05 19:15:15,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 319 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-05 19:15:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-05 19:15:15,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 72. [2024-11-05 19:15:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-05 19:15:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2024-11-05 19:15:15,256 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 173 [2024-11-05 19:15:15,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:15:15,257 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2024-11-05 19:15:15,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-05 19:15:15,257 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2024-11-05 19:15:15,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-05 19:15:15,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:15:15,260 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:15:15,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 19:15:15,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:15:15,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:15:15,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:15:15,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1144959368, now seen corresponding path program 1 times [2024-11-05 19:15:15,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:15:15,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1619849652] [2024-11-05 19:15:15,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:15:15,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:15:15,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:15:15,470 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:15:15,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 19:15:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 19:15:15,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 19:15:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 19:15:15,807 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-05 19:15:15,808 WARN L124 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2024-11-05 19:15:15,808 INFO L325 BasicCegarLoop]: Counterexample might be feasible [2024-11-05 19:15:15,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 19:15:15,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 19:15:16,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:15:16,027 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-05 19:15:16,047 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 19:15:16,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 07:15:16 BoogieIcfgContainer [2024-11-05 19:15:16,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 19:15:16,054 INFO L158 Benchmark]: Toolchain (without parser) took 15528.50ms. Allocated memory was 198.2MB in the beginning and 328.2MB in the end (delta: 130.0MB). Free memory was 142.6MB in the beginning and 262.8MB in the end (delta: -120.2MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2024-11-05 19:15:16,054 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 198.2MB. Free memory was 146.8MB in the beginning and 146.8MB in the end (delta: 71.9kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 19:15:16,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.51ms. Allocated memory is still 198.2MB. Free memory was 142.3MB in the beginning and 127.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-05 19:15:16,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.89ms. Allocated memory is still 198.2MB. Free memory was 127.2MB in the beginning and 125.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 19:15:16,057 INFO L158 Benchmark]: Boogie Preprocessor took 67.83ms. Allocated memory is still 198.2MB. Free memory was 125.2MB in the beginning and 122.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-05 19:15:16,057 INFO L158 Benchmark]: RCFGBuilder took 5987.98ms. Allocated memory was 198.2MB in the beginning and 328.2MB in the end (delta: 130.0MB). Free memory was 122.4MB in the beginning and 290.4MB in the end (delta: -168.0MB). Peak memory consumption was 21.9MB. Max. memory is 8.0GB. [2024-11-05 19:15:16,058 INFO L158 Benchmark]: TraceAbstraction took 9088.19ms. Allocated memory is still 328.2MB. Free memory was 289.4MB in the beginning and 262.8MB in the end (delta: 26.5MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. [2024-11-05 19:15:16,059 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.82ms. Allocated memory is still 198.2MB. Free memory was 146.8MB in the beginning and 146.8MB in the end (delta: 71.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 327.51ms. Allocated memory is still 198.2MB. Free memory was 142.3MB in the beginning and 127.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.89ms. Allocated memory is still 198.2MB. Free memory was 127.2MB in the beginning and 125.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.83ms. Allocated memory is still 198.2MB. Free memory was 125.2MB in the beginning and 122.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 5987.98ms. Allocated memory was 198.2MB in the beginning and 328.2MB in the end (delta: 130.0MB). Free memory was 122.4MB in the beginning and 290.4MB in the end (delta: -168.0MB). Peak memory consumption was 21.9MB. Max. memory is 8.0GB. * TraceAbstraction took 9088.19ms. Allocated memory is still 328.2MB. Free memory was 289.4MB in the beginning and 262.8MB in the end (delta: 26.5MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 999999; [L23] unsigned short int var_1_2 = 5; [L24] signed long int var_1_4 = -2; [L25] signed long int var_1_6 = 0; [L26] signed long int var_1_7 = 5; [L27] signed long int var_1_8 = 255; [L28] signed long int var_1_9 = 25; [L29] unsigned char var_1_10 = 0; [L30] signed long int var_1_11 = 0; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 0; [L34] unsigned char var_1_15 = 0; [L35] unsigned char var_1_16 = 1; [L36] unsigned char var_1_17 = 1; [L37] unsigned char var_1_18 = 64; [L38] signed char var_1_19 = -10; [L39] unsigned char var_1_20 = 5; [L40] unsigned char last_1_var_1_18 = 64; [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L109] last_1_var_1_18 = var_1_18 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_2 >= 0) [L20] COND FALSE !(!cond) [L65] RET assume_abort_if_not(var_1_2 >= 0) [L66] CALL assume_abort_if_not(var_1_2 <= 65535) [L20] COND FALSE !(!cond) [L66] RET assume_abort_if_not(var_1_2 <= 65535) [L67] var_1_4 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_4 >= -2147483648) [L20] COND FALSE !(!cond) [L68] RET assume_abort_if_not(var_1_4 >= -2147483648) [L69] CALL assume_abort_if_not(var_1_4 <= 2147483647) [L20] COND FALSE !(!cond) [L69] RET assume_abort_if_not(var_1_4 <= 2147483647) [L70] var_1_6 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_6 >= 2147483647) [L20] COND FALSE !(!cond) [L71] RET assume_abort_if_not(var_1_6 >= 2147483647) [L72] CALL assume_abort_if_not(var_1_6 <= 2147483647) [L20] COND FALSE !(!cond) [L72] RET assume_abort_if_not(var_1_6 <= 2147483647) [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= 0) [L20] COND FALSE !(!cond) [L74] RET assume_abort_if_not(var_1_7 >= 0) [L75] CALL assume_abort_if_not(var_1_7 <= 2147483647) [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not(var_1_7 <= 2147483647) [L76] var_1_8 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_8 >= 0) [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(var_1_8 >= 0) [L78] CALL assume_abort_if_not(var_1_8 <= 2147483647) [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(var_1_8 <= 2147483647) [L79] var_1_10 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_10 >= 0) [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(var_1_10 >= 0) [L81] CALL assume_abort_if_not(var_1_10 <= 1) [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not(var_1_10 <= 1) [L82] var_1_11 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_11 >= 2147483647) [L20] COND FALSE !(!cond) [L83] RET assume_abort_if_not(var_1_11 >= 2147483647) [L84] CALL assume_abort_if_not(var_1_11 <= 2147483647) [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not(var_1_11 <= 2147483647) [L85] var_1_13 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_13 >= 0) [L20] COND FALSE !(!cond) [L86] RET assume_abort_if_not(var_1_13 >= 0) [L87] CALL assume_abort_if_not(var_1_13 <= 0) [L20] COND FALSE !(!cond) [L87] RET assume_abort_if_not(var_1_13 <= 0) [L88] var_1_14 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_14 >= 0) [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not(var_1_14 >= 0) [L90] CALL assume_abort_if_not(var_1_14 <= 0) [L20] COND FALSE !(!cond) [L90] RET assume_abort_if_not(var_1_14 <= 0) [L91] var_1_15 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_15 >= 1) [L20] COND FALSE !(!cond) [L92] RET assume_abort_if_not(var_1_15 >= 1) [L93] CALL assume_abort_if_not(var_1_15 <= 1) [L20] COND FALSE !(!cond) [L93] RET assume_abort_if_not(var_1_15 <= 1) [L94] var_1_16 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_16 >= 1) [L20] COND FALSE !(!cond) [L95] RET assume_abort_if_not(var_1_16 >= 1) [L96] CALL assume_abort_if_not(var_1_16 <= 1) [L20] COND FALSE !(!cond) [L96] RET assume_abort_if_not(var_1_16 <= 1) [L97] var_1_17 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_17 >= 1) [L20] COND FALSE !(!cond) [L98] RET assume_abort_if_not(var_1_17 >= 1) [L99] CALL assume_abort_if_not(var_1_17 <= 1) [L20] COND FALSE !(!cond) [L99] RET assume_abort_if_not(var_1_17 <= 1) [L100] var_1_19 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_19 >= -128) [L20] COND FALSE !(!cond) [L101] RET assume_abort_if_not(var_1_19 >= -128) [L102] CALL assume_abort_if_not(var_1_19 <= 127) [L20] COND FALSE !(!cond) [L102] RET assume_abort_if_not(var_1_19 <= 127) [L103] CALL assume_abort_if_not(var_1_19 != 0) [L20] COND FALSE !(!cond) [L103] RET assume_abort_if_not(var_1_19 != 0) [L104] var_1_20 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_20 >= 0) [L20] COND FALSE !(!cond) [L105] RET assume_abort_if_not(var_1_20 >= 0) [L106] CALL assume_abort_if_not(var_1_20 <= 254) [L20] COND FALSE !(!cond) [L106] RET assume_abort_if_not(var_1_20 <= 254) [L120] RET updateVariables() [L121] CALL step() [L44] COND FALSE !(((var_1_2 + var_1_4) / var_1_19) != last_1_var_1_18) [L47] COND TRUE (var_1_18 / 32) < (((((var_1_18 + var_1_18)) < (var_1_18)) ? ((var_1_18 + var_1_18)) : (var_1_18))) [L48] var_1_1 = ((var_1_6 - var_1_7) - var_1_8) [L52] COND TRUE var_1_18 == var_1_18 [L53] COND TRUE \read(var_1_10) [L54] var_1_12 = (var_1_13 || var_1_14) [L59] COND FALSE !(\read(var_1_12)) [L121] RET step() [L122] CALL, EXPR property() [L112-L113] return (((((var_1_18 / 32) < (((((var_1_18 + var_1_18)) < (var_1_18)) ? ((var_1_18 + var_1_18)) : (var_1_18)))) ? (var_1_1 == ((signed long int) ((var_1_6 - var_1_7) - var_1_8))) : (var_1_1 == ((signed long int) (var_1_8 - var_1_7)))) && (var_1_12 ? (var_1_9 == ((signed long int) (((((var_1_8) < (var_1_6)) ? (var_1_8) : (var_1_6))) - (var_1_11 - 0.8f)))) : 1)) && ((var_1_18 == var_1_18) ? (var_1_10 ? (var_1_12 == ((unsigned char) (var_1_13 || var_1_14))) : (var_1_12 == ((unsigned char) (((var_1_8 >= var_1_1) || var_1_15) && ((var_1_13 || var_1_16) && var_1_17))))) : 1)) && ((((var_1_2 + var_1_4) / var_1_19) != last_1_var_1_18) ? (var_1_18 == ((unsigned char) var_1_20)) : 1) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) [L19] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 3, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 414 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 475 IncrementalHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 206 mSDtfsCounter, 475 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 708 GetRequests, 676 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=2, InterpolantAutomatonStates: 30, 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, 2 MinimizatonAttempts, 79 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 686 ConstructedInterpolants, 0 QuantifiedInterpolants, 1511 SizeOfPredicates, 3 NumberOfNonLiveVariables, 534 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6313/6496 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-05 19:15:16,127 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...