./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-69.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aff71e7b4e8d979ff4682857055bc958629e28b9f2753e6b08b585745aacec8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:55:12,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:55:12,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:55:12,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:55:12,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:55:12,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:55:12,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:55:12,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:55:12,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:55:12,580 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:55:12,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:55:12,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:55:12,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:55:12,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:55:12,582 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:55:12,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:55:12,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:55:12,584 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:55:12,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:55:12,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:55:12,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:55:12,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:55:12,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:55:12,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:55:12,589 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:55:12,589 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:55:12,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:55:12,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:55:12,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:55:12,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:55:12,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:55:12,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:55:12,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:55:12,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:55:12,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:55:12,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:55:12,592 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:55:12,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:55:12,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:55:12,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:55:12,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:55:12,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:55:12,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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9aff71e7b4e8d979ff4682857055bc958629e28b9f2753e6b08b585745aacec8 [2024-11-20 05:55:12,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:55:12,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:55:12,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:55:12,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:55:12,918 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:55:12,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-69.i [2024-11-20 05:55:14,395 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:55:14,631 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:55:14,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-69.i [2024-11-20 05:55:14,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/116dbdce5/e64e7adbf22c4d05ab86a37ead689567/FLAG014bee072 [2024-11-20 05:55:14,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/116dbdce5/e64e7adbf22c4d05ab86a37ead689567 [2024-11-20 05:55:14,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:55:14,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:55:14,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:55:14,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:55:14,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:55:14,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:55:14" (1/1) ... [2024-11-20 05:55:14,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6ccd80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14, skipping insertion in model container [2024-11-20 05:55:14,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:55:14" (1/1) ... [2024-11-20 05:55:14,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:55:14,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-69.i[917,930] [2024-11-20 05:55:14,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:55:14,938 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:55:14,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-69.i[917,930] [2024-11-20 05:55:14,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:55:14,990 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:55:14,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14 WrapperNode [2024-11-20 05:55:14,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:55:14,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:55:14,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:55:14,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:55:15,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14" (1/1) ... [2024-11-20 05:55:15,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14" (1/1) ... [2024-11-20 05:55:15,035 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-20 05:55:15,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:55:15,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:55:15,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:55:15,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:55:15,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14" (1/1) ... [2024-11-20 05:55:15,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14" (1/1) ... [2024-11-20 05:55:15,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14" (1/1) ... [2024-11-20 05:55:15,069 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-20 05:55:15,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14" (1/1) ... [2024-11-20 05:55:15,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14" (1/1) ... [2024-11-20 05:55:15,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14" (1/1) ... [2024-11-20 05:55:15,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14" (1/1) ... [2024-11-20 05:55:15,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14" (1/1) ... [2024-11-20 05:55:15,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14" (1/1) ... [2024-11-20 05:55:15,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:55:15,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:55:15,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:55:15,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:55:15,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14" (1/1) ... [2024-11-20 05:55:15,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:55:15,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:55:15,119 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-20 05:55:15,124 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-20 05:55:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:55:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:55:15,176 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:55:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:55:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:55:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:55:15,231 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:55:15,233 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:55:15,472 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 05:55:15,472 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:55:15,490 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:55:15,491 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:55:15,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:55:15 BoogieIcfgContainer [2024-11-20 05:55:15,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:55:15,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:55:15,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:55:15,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:55:15,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:55:14" (1/3) ... [2024-11-20 05:55:15,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365d0a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:55:15, skipping insertion in model container [2024-11-20 05:55:15,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:14" (2/3) ... [2024-11-20 05:55:15,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365d0a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:55:15, skipping insertion in model container [2024-11-20 05:55:15,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:55:15" (3/3) ... [2024-11-20 05:55:15,504 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-69.i [2024-11-20 05:55:15,519 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:55:15,520 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:55:15,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:55:15,579 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;@51f59ff2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:55:15,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:55:15,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 05:55:15,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 05:55:15,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:55:15,593 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:55:15,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:55:15,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:55:15,597 INFO L85 PathProgramCache]: Analyzing trace with hash 18237889, now seen corresponding path program 1 times [2024-11-20 05:55:15,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:55:15,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239882798] [2024-11-20 05:55:15,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:55:15,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:55:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:55:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:55:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:55:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:55:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:55:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:55:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:55:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:55:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:55:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:55:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:55:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:55:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:55:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:55:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:55:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 05:55:15,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:55:15,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239882798] [2024-11-20 05:55:15,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239882798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:55:15,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:55:15,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:55:15,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476864483] [2024-11-20 05:55:15,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:55:15,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:55:15,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:55:15,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:55:15,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:55:15,988 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 05:55:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:55:16,014 INFO L93 Difference]: Finished difference Result 97 states and 163 transitions. [2024-11-20 05:55:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:55:16,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-11-20 05:55:16,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:55:16,038 INFO L225 Difference]: With dead ends: 97 [2024-11-20 05:55:16,042 INFO L226 Difference]: Without dead ends: 48 [2024-11-20 05:55:16,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-20 05:55:16,052 INFO L432 NwaCegarLoop]: 70 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, 70 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-20 05:55:16,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:55:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-20 05:55:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-20 05:55:16,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 05:55:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2024-11-20 05:55:16,134 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 97 [2024-11-20 05:55:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:55:16,135 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2024-11-20 05:55:16,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 05:55:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2024-11-20 05:55:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 05:55:16,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:55:16,142 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:55:16,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:55:16,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:55:16,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:55:16,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1234104317, now seen corresponding path program 1 times [2024-11-20 05:55:16,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:55:16,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848708470] [2024-11-20 05:55:16,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:55:16,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:55:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 05:55:16,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240134002] [2024-11-20 05:55:16,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:55:16,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:55:16,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:55:16,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:55:16,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 05:55:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:55:18,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:55:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:55:18,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:55:18,524 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:55:18,525 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:55:18,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 05:55:18,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:55:18,731 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-20 05:55:18,808 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:55:18,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:55:18 BoogieIcfgContainer [2024-11-20 05:55:18,812 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:55:18,812 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:55:18,812 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:55:18,812 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:55:18,813 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:55:15" (3/4) ... [2024-11-20 05:55:18,815 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:55:18,816 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:55:18,816 INFO L158 Benchmark]: Toolchain (without parser) took 4152.10ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 71.0MB in the beginning and 113.2MB in the end (delta: -42.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:55:18,816 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:55:18,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.96ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 70.9MB in the beginning and 142.5MB in the end (delta: -71.6MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-11-20 05:55:18,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.56ms. Allocated memory is still 172.0MB. Free memory was 141.4MB in the beginning and 140.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:55:18,819 INFO L158 Benchmark]: Boogie Preprocessor took 48.02ms. Allocated memory is still 172.0MB. Free memory was 140.4MB in the beginning and 137.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:55:18,820 INFO L158 Benchmark]: RCFGBuilder took 406.18ms. Allocated memory is still 172.0MB. Free memory was 137.2MB in the beginning and 121.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 05:55:18,820 INFO L158 Benchmark]: TraceAbstraction took 3318.23ms. Allocated memory is still 172.0MB. Free memory was 120.5MB in the beginning and 114.2MB in the end (delta: 6.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-11-20 05:55:18,820 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 172.0MB. Free memory was 114.2MB in the beginning and 113.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:55:18,826 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.18ms. Allocated memory is still 142.6MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.96ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 70.9MB in the beginning and 142.5MB in the end (delta: -71.6MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.56ms. Allocated memory is still 172.0MB. Free memory was 141.4MB in the beginning and 140.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.02ms. Allocated memory is still 172.0MB. Free memory was 140.4MB in the beginning and 137.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 406.18ms. Allocated memory is still 172.0MB. Free memory was 137.2MB in the beginning and 121.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3318.23ms. Allocated memory is still 172.0MB. Free memory was 120.5MB in the beginning and 114.2MB in the end (delta: 6.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 172.0MB. Free memory was 114.2MB in the beginning and 113.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * 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: overapproximation of someBinaryDOUBLEComparisonOperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -100; [L23] unsigned long int var_1_2 = 0; [L24] unsigned long int var_1_3 = 8; [L25] unsigned long int var_1_4 = 256; [L26] unsigned long int var_1_5 = 500; [L27] signed char var_1_7 = -64; [L28] signed char var_1_8 = -8; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 4.625; [L32] double var_1_13 = 15.5; VAL [isInitial=0, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_2=0, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L76] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L77] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L78] var_1_3 = __VERIFIER_nondet_ulong() [L79] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L79] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L80] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L81] var_1_4 = __VERIFIER_nondet_ulong() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_4 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L83] RET assume_abort_if_not(var_1_4 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L84] var_1_5 = __VERIFIER_nondet_ulong() [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L86] CALL assume_abort_if_not(var_1_5 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L86] RET assume_abort_if_not(var_1_5 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L87] var_1_8 = __VERIFIER_nondet_char() [L88] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L90] var_1_9 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0] [L91] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0] [L92] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L93] var_1_10 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L96] var_1_13 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L110] RET updateVariables() [L111] CALL step() [L36] COND TRUE var_1_2 < (((((var_1_4 * var_1_5)) > (var_1_3)) ? ((var_1_4 * var_1_5)) : (var_1_3))) [L37] var_1_7 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L49] unsigned long int stepLocal_1 = var_1_5; [L50] unsigned long int stepLocal_0 = var_1_2 * ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L51] COND FALSE !(stepLocal_0 < var_1_5) VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L58] unsigned char stepLocal_3 = var_1_9; [L59] signed long int stepLocal_2 = var_1_1 + var_1_7; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=-100, stepLocal_3=0, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L60] COND FALSE !(((var_1_7 + var_1_8) == var_1_4) && stepLocal_3) [L71] var_1_11 = var_1_13 VAL [isInitial=1, stepLocal_1=0, stepLocal_2=-100, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L111] RET step() [L112] CALL, EXPR property() [L102-L103] return ((((var_1_2 * ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < var_1_5) ? ((var_1_5 > var_1_2) ? (var_1_1 == ((signed short int) var_1_7)) : (var_1_1 == ((signed short int) var_1_7))) : 1) && ((var_1_2 < (((((var_1_4 * var_1_5)) > (var_1_3)) ? ((var_1_4 * var_1_5)) : (var_1_3)))) ? (var_1_7 == ((signed char) var_1_8)) : ((var_1_9 || var_1_10) ? (var_1_7 == ((signed char) var_1_8)) : ((var_1_3 < var_1_4) ? (var_1_7 == ((signed char) var_1_8)) : (var_1_7 == ((signed char) -4)))))) && ((((var_1_7 + var_1_8) == var_1_4) && var_1_9) ? ((! var_1_10) ? (((var_1_1 + var_1_7) != var_1_8) ? (var_1_11 == ((double) var_1_13)) : (var_1_11 == ((double) var_1_13))) : (var_1_11 == ((double) var_1_13))) : (var_1_11 == ((double) var_1_13))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 2, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 70 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 420/420 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-20 05:55:18,847 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-69.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aff71e7b4e8d979ff4682857055bc958629e28b9f2753e6b08b585745aacec8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:55:21,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:55:21,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:55:21,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:55:21,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:55:21,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:55:21,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:55:21,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:55:21,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:55:21,245 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:55:21,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:55:21,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:55:21,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:55:21,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:55:21,247 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:55:21,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:55:21,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:55:21,248 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:55:21,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:55:21,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:55:21,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:55:21,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:55:21,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:55:21,251 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:55:21,251 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:55:21,251 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:55:21,252 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:55:21,252 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:55:21,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:55:21,253 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:55:21,253 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:55:21,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:55:21,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:55:21,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:55:21,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:55:21,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:55:21,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:55:21,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:55:21,255 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:55:21,256 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:55:21,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:55:21,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:55:21,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:55:21,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:55:21,259 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9aff71e7b4e8d979ff4682857055bc958629e28b9f2753e6b08b585745aacec8 [2024-11-20 05:55:21,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:55:21,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:55:21,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:55:21,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:55:21,620 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:55:21,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-69.i [2024-11-20 05:55:23,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:55:23,356 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:55:23,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-69.i [2024-11-20 05:55:23,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a026752/ef470342400049ffae63405287b803bb/FLAG1319ff1d8 [2024-11-20 05:55:23,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a026752/ef470342400049ffae63405287b803bb [2024-11-20 05:55:23,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:55:23,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:55:23,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:55:23,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:55:23,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:55:23,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:55:23" (1/1) ... [2024-11-20 05:55:23,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30637a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23, skipping insertion in model container [2024-11-20 05:55:23,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:55:23" (1/1) ... [2024-11-20 05:55:23,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:55:23,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-69.i[917,930] [2024-11-20 05:55:23,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:55:23,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:55:23,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-69.i[917,930] [2024-11-20 05:55:23,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:55:23,761 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:55:23,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23 WrapperNode [2024-11-20 05:55:23,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:55:23,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:55:23,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:55:23,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:55:23,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23" (1/1) ... [2024-11-20 05:55:23,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23" (1/1) ... [2024-11-20 05:55:23,815 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-20 05:55:23,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:55:23,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:55:23,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:55:23,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:55:23,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23" (1/1) ... [2024-11-20 05:55:23,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23" (1/1) ... [2024-11-20 05:55:23,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23" (1/1) ... [2024-11-20 05:55:23,849 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-20 05:55:23,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23" (1/1) ... [2024-11-20 05:55:23,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23" (1/1) ... [2024-11-20 05:55:23,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23" (1/1) ... [2024-11-20 05:55:23,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23" (1/1) ... [2024-11-20 05:55:23,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23" (1/1) ... [2024-11-20 05:55:23,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23" (1/1) ... [2024-11-20 05:55:23,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:55:23,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:55:23,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:55:23,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:55:23,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23" (1/1) ... [2024-11-20 05:55:23,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:55:23,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:55:23,920 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-20 05:55:23,926 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-20 05:55:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:55:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:55:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:55:23,966 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:55:23,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:55:23,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:55:24,049 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:55:24,051 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:55:24,360 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 05:55:24,361 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:55:24,378 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:55:24,378 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:55:24,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:55:24 BoogieIcfgContainer [2024-11-20 05:55:24,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:55:24,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:55:24,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:55:24,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:55:24,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:55:23" (1/3) ... [2024-11-20 05:55:24,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22743c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:55:24, skipping insertion in model container [2024-11-20 05:55:24,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:55:23" (2/3) ... [2024-11-20 05:55:24,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22743c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:55:24, skipping insertion in model container [2024-11-20 05:55:24,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:55:24" (3/3) ... [2024-11-20 05:55:24,388 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-69.i [2024-11-20 05:55:24,405 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:55:24,405 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:55:24,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:55:24,493 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;@18dde76d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:55:24,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:55:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 05:55:24,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 05:55:24,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:55:24,511 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:55:24,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:55:24,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:55:24,517 INFO L85 PathProgramCache]: Analyzing trace with hash 18237889, now seen corresponding path program 1 times [2024-11-20 05:55:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:55:24,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107707002] [2024-11-20 05:55:24,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:55:24,534 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-20 05:55:24,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:55:24,537 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-20 05:55:24,542 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-20 05:55:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:24,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:55:24,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:55:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-20 05:55:24,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:55:24,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:55:24,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107707002] [2024-11-20 05:55:24,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107707002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:55:24,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:55:24,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:55:24,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292035599] [2024-11-20 05:55:24,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:55:24,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:55:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:55:24,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:55:24,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:55:24,788 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 05:55:24,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:55:24,813 INFO L93 Difference]: Finished difference Result 97 states and 163 transitions. [2024-11-20 05:55:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:55:24,815 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-11-20 05:55:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:55:24,822 INFO L225 Difference]: With dead ends: 97 [2024-11-20 05:55:24,822 INFO L226 Difference]: Without dead ends: 48 [2024-11-20 05:55:24,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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-20 05:55:24,828 INFO L432 NwaCegarLoop]: 70 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, 70 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-20 05:55:24,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:55:24,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-20 05:55:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-20 05:55:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 05:55:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2024-11-20 05:55:24,866 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 97 [2024-11-20 05:55:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:55:24,867 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2024-11-20 05:55:24,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 05:55:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2024-11-20 05:55:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 05:55:24,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:55:24,874 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:55:24,882 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-20 05:55:25,075 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-20 05:55:25,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:55:25,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:55:25,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1234104317, now seen corresponding path program 1 times [2024-11-20 05:55:25,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:55:25,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920278633] [2024-11-20 05:55:25,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:55:25,078 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-20 05:55:25,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:55:25,080 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-20 05:55:25,081 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-20 05:55:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:25,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 05:55:25,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:55:43,706 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-20 05:55:43,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:55:43,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:55:43,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920278633] [2024-11-20 05:55:43,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920278633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:55:43,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:55:43,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 05:55:43,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444487394] [2024-11-20 05:55:43,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:55:43,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 05:55:43,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:55:43,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 05:55:43,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-20 05:55:43,712 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:55:49,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:55:49,870 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2024-11-20 05:55:49,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 05:55:49,876 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-20 05:55:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:55:49,879 INFO L225 Difference]: With dead ends: 81 [2024-11-20 05:55:49,879 INFO L226 Difference]: Without dead ends: 79 [2024-11-20 05:55:49,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-20 05:55:49,881 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 141 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-20 05:55:49,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 212 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-20 05:55:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-20 05:55:49,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2024-11-20 05:55:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 05:55:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2024-11-20 05:55:49,898 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 97 [2024-11-20 05:55:49,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:55:49,900 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2024-11-20 05:55:49,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:55:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2024-11-20 05:55:49,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 05:55:49,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:55:49,902 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:55:49,909 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-20 05:55:50,103 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-20 05:55:50,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:55:50,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:55:50,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1291265105, now seen corresponding path program 1 times [2024-11-20 05:55:50,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:55:50,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563401690] [2024-11-20 05:55:50,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:55:50,105 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-20 05:55:50,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:55:50,111 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-20 05:55:50,112 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-20 05:55:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:50,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 05:55:50,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:56:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-20 05:56:02,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:56:02,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:56:02,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563401690] [2024-11-20 05:56:02,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563401690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:56:02,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:56:02,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 05:56:02,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540642511] [2024-11-20 05:56:02,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:56:02,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 05:56:02,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:56:02,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 05:56:02,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-20 05:56:02,575 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:56:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:56:06,470 INFO L93 Difference]: Finished difference Result 79 states and 108 transitions. [2024-11-20 05:56:06,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 05:56:06,472 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-20 05:56:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:56:06,474 INFO L225 Difference]: With dead ends: 79 [2024-11-20 05:56:06,474 INFO L226 Difference]: Without dead ends: 77 [2024-11-20 05:56:06,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2024-11-20 05:56:06,476 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 100 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-20 05:56:06,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 241 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-20 05:56:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-20 05:56:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2024-11-20 05:56:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 05:56:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2024-11-20 05:56:06,486 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 98 [2024-11-20 05:56:06,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:56:06,487 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2024-11-20 05:56:06,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:56:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2024-11-20 05:56:06,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 05:56:06,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:56:06,492 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:56:06,500 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-20 05:56:06,693 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-20 05:56:06,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:56:06,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:56:06,694 INFO L85 PathProgramCache]: Analyzing trace with hash -868023798, now seen corresponding path program 1 times [2024-11-20 05:56:06,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:56:06,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985686206] [2024-11-20 05:56:06,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:56:06,695 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-20 05:56:06,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:56:06,699 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-20 05:56:06,700 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-20 05:56:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:06,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 05:56:06,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:56:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-20 05:56:16,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:56:16,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:56:16,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985686206] [2024-11-20 05:56:16,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985686206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:56:16,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:56:16,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 05:56:16,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647509031] [2024-11-20 05:56:16,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:56:16,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 05:56:16,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:56:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 05:56:16,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-20 05:56:16,324 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:56:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:56:27,044 INFO L93 Difference]: Finished difference Result 94 states and 128 transitions. [2024-11-20 05:56:27,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 05:56:27,053 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-20 05:56:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:56:27,055 INFO L225 Difference]: With dead ends: 94 [2024-11-20 05:56:27,055 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 05:56:27,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2024-11-20 05:56:27,056 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 127 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-20 05:56:27,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 261 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-20 05:56:27,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 05:56:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2024-11-20 05:56:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 05:56:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2024-11-20 05:56:27,068 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 98 [2024-11-20 05:56:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:56:27,069 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2024-11-20 05:56:27,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:56:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2024-11-20 05:56:27,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 05:56:27,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:56:27,071 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:56:27,079 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-20 05:56:27,274 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-20 05:56:27,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:56:27,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:56:27,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1443199976, now seen corresponding path program 1 times [2024-11-20 05:56:27,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:56:27,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17141031] [2024-11-20 05:56:27,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:56:27,276 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-20 05:56:27,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:56:27,278 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-20 05:56:27,279 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-20 05:56:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:27,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 05:56:27,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:56:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-20 05:56:33,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:56:33,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:56:33,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17141031] [2024-11-20 05:56:33,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17141031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:56:33,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:56:33,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 05:56:33,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153810015] [2024-11-20 05:56:33,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:56:33,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 05:56:33,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:56:33,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 05:56:33,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-20 05:56:33,444 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:56:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:56:40,848 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2024-11-20 05:56:40,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 05:56:40,853 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-20 05:56:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:56:40,855 INFO L225 Difference]: With dead ends: 175 [2024-11-20 05:56:40,856 INFO L226 Difference]: Without dead ends: 114 [2024-11-20 05:56:40,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2024-11-20 05:56:40,857 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 141 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-20 05:56:40,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 291 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-20 05:56:40,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-20 05:56:40,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2024-11-20 05:56:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 05:56:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 104 transitions. [2024-11-20 05:56:40,870 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 104 transitions. Word has length 99 [2024-11-20 05:56:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:56:40,871 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 104 transitions. [2024-11-20 05:56:40,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:56:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 104 transitions. [2024-11-20 05:56:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 05:56:40,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:56:40,873 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:56:40,881 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 (6)] Forceful destruction successful, exit code 0 [2024-11-20 05:56:41,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:56:41,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:56:41,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:56:41,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2123258346, now seen corresponding path program 1 times [2024-11-20 05:56:41,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:56:41,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49811432] [2024-11-20 05:56:41,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:56:41,076 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-20 05:56:41,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:56:41,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:56:41,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 05:56:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:56:41,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 05:56:41,172 INFO L278 TraceCheckSpWp]: Computing forward predicates...