./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.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 e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:56:56,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:56:56,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:56:56,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:56:56,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:56:56,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:56:56,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:56:56,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:56:56,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:56:56,615 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:56:56,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:56:56,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:56:56,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:56:56,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:56:56,617 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:56:56,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:56:56,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:56:56,618 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:56:56,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:56:56,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:56:56,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:56:56,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:56:56,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:56:56,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:56:56,621 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:56:56,621 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:56:56,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:56:56,622 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:56:56,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:56:56,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:56:56,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:56:56,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:56:56,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:56:56,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:56:56,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:56:56,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:56:56,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:56:56,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:56:56,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:56:56,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:56:56,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:56:56,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:56:56,629 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 -> e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 [2024-11-10 06:56:56,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:56:56,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:56:56,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:56:56,919 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:56:56,920 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:56:56,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-10 06:56:58,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:56:58,659 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:56:58,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-10 06:56:58,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/590269133/2b8ec7dbf6ce43279b2f7aec7c3bb189/FLAG13c9bf7d9 [2024-11-10 06:56:58,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/590269133/2b8ec7dbf6ce43279b2f7aec7c3bb189 [2024-11-10 06:56:58,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:56:58,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:56:58,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:56:58,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:56:58,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:56:58,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:56:58" (1/1) ... [2024-11-10 06:56:58,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b0de27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:58, skipping insertion in model container [2024-11-10 06:56:58,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:56:58" (1/1) ... [2024-11-10 06:56:58,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:56:58,909 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_no-floats_file-78.i[916,929] [2024-11-10 06:56:58,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:56:58,954 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:56:58,966 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_no-floats_file-78.i[916,929] [2024-11-10 06:56:58,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:56:59,008 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:56:59,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:59 WrapperNode [2024-11-10 06:56:59,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:56:59,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:56:59,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:56:59,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:56:59,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:59" (1/1) ... [2024-11-10 06:56:59,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:59" (1/1) ... [2024-11-10 06:56:59,052 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-11-10 06:56:59,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:56:59,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:56:59,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:56:59,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:56:59,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:59" (1/1) ... [2024-11-10 06:56:59,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:59" (1/1) ... [2024-11-10 06:56:59,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:59" (1/1) ... [2024-11-10 06:56:59,085 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-10 06:56:59,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:59" (1/1) ... [2024-11-10 06:56:59,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:59" (1/1) ... [2024-11-10 06:56:59,090 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:59" (1/1) ... [2024-11-10 06:56:59,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:59" (1/1) ... [2024-11-10 06:56:59,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:59" (1/1) ... [2024-11-10 06:56:59,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:59" (1/1) ... [2024-11-10 06:56:59,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:56:59,097 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:56:59,097 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:56:59,097 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:56:59,098 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:59" (1/1) ... [2024-11-10 06:56:59,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:56:59,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:56:59,138 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-10 06:56:59,144 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-10 06:56:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:56:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:56:59,190 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:56:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:56:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:56:59,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:56:59,271 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:56:59,273 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:56:59,548 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 06:56:59,548 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:56:59,567 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:56:59,567 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:56:59,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:56:59 BoogieIcfgContainer [2024-11-10 06:56:59,568 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:56:59,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:56:59,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:56:59,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:56:59,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:56:58" (1/3) ... [2024-11-10 06:56:59,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f93c359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:56:59, skipping insertion in model container [2024-11-10 06:56:59,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:59" (2/3) ... [2024-11-10 06:56:59,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f93c359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:56:59, skipping insertion in model container [2024-11-10 06:56:59,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:56:59" (3/3) ... [2024-11-10 06:56:59,577 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-10 06:56:59,592 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:56:59,592 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:56:59,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:56:59,659 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;@71b245db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:56:59,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:56:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 06:56:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 06:56:59,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:56:59,676 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:56:59,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:56:59,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:56:59,681 INFO L85 PathProgramCache]: Analyzing trace with hash 520725669, now seen corresponding path program 1 times [2024-11-10 06:56:59,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:56:59,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126442941] [2024-11-10 06:56:59,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:56:59,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:56:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:56:59,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:56:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:56:59,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:56:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:56:59,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:56:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:56:59,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:56:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:56:59,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:56:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:56:59,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:56:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:56:59,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:56:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:56:59,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:57:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:57:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:57:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:57:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:57:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:57:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:57:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 06:57:00,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:57:00,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126442941] [2024-11-10 06:57:00,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126442941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:57:00,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:57:00,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:57:00,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96689632] [2024-11-10 06:57:00,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:57:00,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:57:00,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:57:00,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:57:00,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:57:00,089 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 06:57:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:57:00,117 INFO L93 Difference]: Finished difference Result 94 states and 153 transitions. [2024-11-10 06:57:00,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:57:00,120 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2024-11-10 06:57:00,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:57:00,129 INFO L225 Difference]: With dead ends: 94 [2024-11-10 06:57:00,129 INFO L226 Difference]: Without dead ends: 46 [2024-11-10 06:57:00,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-10 06:57:00,137 INFO L432 NwaCegarLoop]: 65 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, 65 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-10 06:57:00,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:57:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-10 06:57:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-10 06:57:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 06:57:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-10 06:57:00,185 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 94 [2024-11-10 06:57:00,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:57:00,185 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-10 06:57:00,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 06:57:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-10 06:57:00,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 06:57:00,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:57:00,190 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:57:00,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:57:00,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:57:00,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:57:00,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2065387845, now seen corresponding path program 1 times [2024-11-10 06:57:00,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:57:00,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71814755] [2024-11-10 06:57:00,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:57:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:57:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:57:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:57:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:57:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:57:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:57:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:57:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:57:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:57:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:57:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:57:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:57:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:57:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:57:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:57:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 06:57:00,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:57:00,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71814755] [2024-11-10 06:57:00,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71814755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:57:00,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:57:00,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:57:00,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565860749] [2024-11-10 06:57:00,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:57:00,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:57:00,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:57:00,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:57:00,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:57:00,664 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 06:57:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:57:00,755 INFO L93 Difference]: Finished difference Result 132 states and 189 transitions. [2024-11-10 06:57:00,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:57:00,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-10 06:57:00,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:57:00,760 INFO L225 Difference]: With dead ends: 132 [2024-11-10 06:57:00,762 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 06:57:00,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:57:00,765 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:57:00,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 176 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:57:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 06:57:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-10 06:57:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 06:57:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-11-10 06:57:00,802 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 94 [2024-11-10 06:57:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:57:00,803 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-11-10 06:57:00,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 06:57:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-11-10 06:57:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 06:57:00,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:57:00,805 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:57:00,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:57:00,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:57:00,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:57:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2094016996, now seen corresponding path program 1 times [2024-11-10 06:57:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:57:00,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631581043] [2024-11-10 06:57:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:57:00,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:57:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:57:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:57:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:57:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:57:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:57:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:57:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:57:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:57:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:57:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:57:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:57:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:57:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:57:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:57:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 06:57:02,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:57:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631581043] [2024-11-10 06:57:02,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631581043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:57:02,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:57:02,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 06:57:02,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374406716] [2024-11-10 06:57:02,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:57:02,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 06:57:02,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:57:02,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 06:57:02,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 06:57:02,736 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 06:57:03,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:57:03,416 INFO L93 Difference]: Finished difference Result 171 states and 223 transitions. [2024-11-10 06:57:03,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 06:57:03,416 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2024-11-10 06:57:03,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:57:03,419 INFO L225 Difference]: With dead ends: 171 [2024-11-10 06:57:03,419 INFO L226 Difference]: Without dead ends: 168 [2024-11-10 06:57:03,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-11-10 06:57:03,422 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 160 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:57:03,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 398 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 06:57:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-10 06:57:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 134. [2024-11-10 06:57:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 87 states have (on average 1.160919540229885) internal successors, (101), 89 states have internal predecessors, (101), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 06:57:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 185 transitions. [2024-11-10 06:57:03,469 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 185 transitions. Word has length 94 [2024-11-10 06:57:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:57:03,470 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 185 transitions. [2024-11-10 06:57:03,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 06:57:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 185 transitions. [2024-11-10 06:57:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 06:57:03,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:57:03,472 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:57:03,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:57:03,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:57:03,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:57:03,473 INFO L85 PathProgramCache]: Analyzing trace with hash 297065637, now seen corresponding path program 1 times [2024-11-10 06:57:03,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:57:03,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597807744] [2024-11-10 06:57:03,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:57:03,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:57:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:57:03,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:57:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:57:03,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:57:03,574 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:57:03,575 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:57:03,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:57:03,579 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 06:57:03,653 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:57:03,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:57:03 BoogieIcfgContainer [2024-11-10 06:57:03,657 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:57:03,657 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:57:03,657 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:57:03,658 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:57:03,658 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:56:59" (3/4) ... [2024-11-10 06:57:03,660 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:57:03,661 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:57:03,663 INFO L158 Benchmark]: Toolchain (without parser) took 4967.63ms. Allocated memory was 174.1MB in the beginning and 247.5MB in the end (delta: 73.4MB). Free memory was 117.0MB in the beginning and 195.4MB in the end (delta: -78.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:57:03,663 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 174.1MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:57:03,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.25ms. Allocated memory is still 174.1MB. Free memory was 117.0MB in the beginning and 103.0MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 06:57:03,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.02ms. Allocated memory is still 174.1MB. Free memory was 103.0MB in the beginning and 100.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:57:03,668 INFO L158 Benchmark]: Boogie Preprocessor took 42.08ms. Allocated memory is still 174.1MB. Free memory was 100.9MB in the beginning and 98.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:57:03,668 INFO L158 Benchmark]: IcfgBuilder took 471.31ms. Allocated memory is still 174.1MB. Free memory was 98.7MB in the beginning and 83.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 06:57:03,668 INFO L158 Benchmark]: TraceAbstraction took 4086.20ms. Allocated memory was 174.1MB in the beginning and 247.5MB in the end (delta: 73.4MB). Free memory was 82.5MB in the beginning and 195.4MB in the end (delta: -112.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:57:03,668 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 247.5MB. Free memory is still 195.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:57:03,670 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.21ms. Allocated memory is still 174.1MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.25ms. Allocated memory is still 174.1MB. Free memory was 117.0MB in the beginning and 103.0MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.02ms. Allocated memory is still 174.1MB. Free memory was 103.0MB in the beginning and 100.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.08ms. Allocated memory is still 174.1MB. Free memory was 100.9MB in the beginning and 98.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 471.31ms. Allocated memory is still 174.1MB. Free memory was 98.7MB in the beginning and 83.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4086.20ms. Allocated memory was 174.1MB in the beginning and 247.5MB in the end (delta: 73.4MB). Free memory was 82.5MB in the beginning and 195.4MB in the end (delta: -112.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 247.5MB. Free memory is still 195.4MB. 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 to_int at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -200; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed long int var_1_9 = 100; [L26] signed long int var_1_10 = 4; [L27] signed long int var_1_11 = 128; [L28] signed long int var_1_12 = 128; [L29] signed long int var_1_13 = 0; [L30] signed long int var_1_14 = 127; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 16; VAL [isInitial=0, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_9=100] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L66] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L67] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L67] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L68] var_1_3 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L69] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L70] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L70] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L71] var_1_10 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L72] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L73] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L73] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L74] var_1_11 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L75] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L76] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L76] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L77] var_1_13 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L78] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L79] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L79] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L80] var_1_14 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L81] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L82] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L82] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L83] var_1_16 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L84] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L85] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L85] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L98] RET updateVariables() [L99] CALL step() [L36] COND FALSE !(0.8f > (- var_1_10)) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L39] unsigned char stepLocal_1 = var_1_15 > var_1_15; [L40] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=-256, stepLocal_1=0, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L41] COND FALSE !(var_1_2 && stepLocal_0) VAL [isInitial=1, stepLocal_1=0, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L48] COND TRUE \read(var_1_2) [L49] var_1_9 = (var_1_10 - var_1_11) VAL [isInitial=1, stepLocal_1=0, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L57] signed long int stepLocal_2 = var_1_1; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=-200, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L58] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L61] var_1_12 = ((var_1_13 - var_1_14) - var_1_11) VAL [isInitial=1, stepLocal_1=0, var_1_10=2147483646, var_1_11=2147483646, var_1_12=1, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return ((((var_1_2 && var_1_3) ? ((var_1_2 && (var_1_15 > var_1_15)) ? (var_1_1 == ((signed long int) (var_1_15 - var_1_15))) : (var_1_1 == ((signed long int) ((var_1_15 + 5) - var_1_15)))) : 1) && (var_1_2 ? (var_1_9 == ((signed long int) (var_1_10 - var_1_11))) : ((var_1_1 < var_1_15) ? (var_1_9 == ((signed long int) ((((var_1_11) > (var_1_10)) ? (var_1_11) : (var_1_10))))) : (var_1_9 == ((signed long int) var_1_10))))) && ((var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (var_1_12 == ((signed long int) (var_1_10 - 99.5))) : (var_1_12 == ((signed long int) ((var_1_13 - var_1_14) - var_1_11))))) && ((0.8f > (- var_1_10)) ? (var_1_15 == ((unsigned char) var_1_16)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=1, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=1, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=1, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 639 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 424 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 282 IncrementalHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 215 mSDtfsCounter, 282 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=3, InterpolantAutomatonStates: 18, 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, 3 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 1327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1092/1092 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-10 06:57:03,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.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 e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:57:05,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:57:05,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:57:05,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:57:05,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:57:06,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:57:06,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:57:06,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:57:06,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:57:06,007 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:57:06,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:57:06,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:57:06,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:57:06,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:57:06,008 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:57:06,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:57:06,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:57:06,009 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:57:06,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:57:06,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:57:06,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:57:06,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:57:06,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:57:06,012 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:57:06,012 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:57:06,012 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:57:06,013 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:57:06,013 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:57:06,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:57:06,013 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:57:06,014 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:57:06,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:57:06,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:57:06,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:57:06,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:57:06,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:57:06,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:57:06,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:57:06,017 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:57:06,017 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:57:06,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:57:06,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:57:06,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:57:06,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:57:06,018 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 -> e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 [2024-11-10 06:57:06,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:57:06,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:57:06,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:57:06,375 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:57:06,376 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:57:06,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-10 06:57:07,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:57:08,093 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:57:08,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-10 06:57:08,102 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a44978fa9/92e229d892794b089d967d4a524a14c8/FLAGf8eed8aae [2024-11-10 06:57:08,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a44978fa9/92e229d892794b089d967d4a524a14c8 [2024-11-10 06:57:08,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:57:08,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:57:08,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:57:08,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:57:08,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:57:08,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:57:08" (1/1) ... [2024-11-10 06:57:08,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b04f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08, skipping insertion in model container [2024-11-10 06:57:08,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:57:08" (1/1) ... [2024-11-10 06:57:08,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:57:08,707 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_no-floats_file-78.i[916,929] [2024-11-10 06:57:08,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:57:08,780 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:57:08,797 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_no-floats_file-78.i[916,929] [2024-11-10 06:57:08,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:57:08,833 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:57:08,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08 WrapperNode [2024-11-10 06:57:08,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:57:08,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:57:08,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:57:08,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:57:08,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08" (1/1) ... [2024-11-10 06:57:08,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08" (1/1) ... [2024-11-10 06:57:08,885 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2024-11-10 06:57:08,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:57:08,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:57:08,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:57:08,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:57:08,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08" (1/1) ... [2024-11-10 06:57:08,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08" (1/1) ... [2024-11-10 06:57:08,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08" (1/1) ... [2024-11-10 06:57:08,919 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-10 06:57:08,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08" (1/1) ... [2024-11-10 06:57:08,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08" (1/1) ... [2024-11-10 06:57:08,932 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08" (1/1) ... [2024-11-10 06:57:08,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08" (1/1) ... [2024-11-10 06:57:08,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08" (1/1) ... [2024-11-10 06:57:08,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08" (1/1) ... [2024-11-10 06:57:08,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:57:08,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:57:08,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:57:08,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:57:08,952 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08" (1/1) ... [2024-11-10 06:57:08,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:57:08,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:57:08,987 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-10 06:57:08,990 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-10 06:57:09,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:57:09,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:57:09,036 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:57:09,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:57:09,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:57:09,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:57:09,130 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:57:09,133 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:57:11,520 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 06:57:11,521 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:57:11,534 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:57:11,534 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:57:11,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:57:11 BoogieIcfgContainer [2024-11-10 06:57:11,535 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:57:11,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:57:11,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:57:11,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:57:11,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:57:08" (1/3) ... [2024-11-10 06:57:11,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576d600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:57:11, skipping insertion in model container [2024-11-10 06:57:11,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:57:08" (2/3) ... [2024-11-10 06:57:11,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576d600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:57:11, skipping insertion in model container [2024-11-10 06:57:11,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:57:11" (3/3) ... [2024-11-10 06:57:11,543 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-10 06:57:11,559 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:57:11,560 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:57:11,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:57:11,625 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;@465474c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:57:11,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:57:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 06:57:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 06:57:11,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:57:11,638 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:57:11,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:57:11,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:57:11,643 INFO L85 PathProgramCache]: Analyzing trace with hash 520725669, now seen corresponding path program 1 times [2024-11-10 06:57:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:57:11,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366481699] [2024-11-10 06:57:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:57:11,655 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-10 06:57:11,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:57:11,659 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-10 06:57:11,661 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-10 06:57:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:11,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:57:11,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:57:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-10 06:57:11,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:57:11,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:57:11,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366481699] [2024-11-10 06:57:11,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366481699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:57:11,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:57:11,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:57:11,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269112389] [2024-11-10 06:57:11,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:57:11,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:57:11,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:57:11,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:57:11,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:57:11,984 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 06:57:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:57:12,017 INFO L93 Difference]: Finished difference Result 94 states and 153 transitions. [2024-11-10 06:57:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:57:12,019 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-10 06:57:12,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:57:12,028 INFO L225 Difference]: With dead ends: 94 [2024-11-10 06:57:12,029 INFO L226 Difference]: Without dead ends: 46 [2024-11-10 06:57:12,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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-10 06:57:12,040 INFO L432 NwaCegarLoop]: 65 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, 65 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-10 06:57:12,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:57:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-10 06:57:12,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-10 06:57:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 06:57:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-10 06:57:12,095 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 94 [2024-11-10 06:57:12,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:57:12,096 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-10 06:57:12,097 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 06:57:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-10 06:57:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 06:57:12,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:57:12,104 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:57:12,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 06:57:12,305 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-10 06:57:12,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:57:12,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:57:12,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2065387845, now seen corresponding path program 1 times [2024-11-10 06:57:12,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:57:12,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297111281] [2024-11-10 06:57:12,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:57:12,309 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-10 06:57:12,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:57:12,313 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-10 06:57:12,316 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-10 06:57:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:12,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 06:57:12,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:57:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 06:57:13,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:57:13,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:57:13,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297111281] [2024-11-10 06:57:13,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297111281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:57:13,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:57:13,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:57:13,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564292937] [2024-11-10 06:57:13,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:57:13,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:57:13,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:57:13,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:57:13,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:57:13,167 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 06:57:14,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:57:16,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:57:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:57:16,639 INFO L93 Difference]: Finished difference Result 132 states and 189 transitions. [2024-11-10 06:57:16,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:57:16,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-10 06:57:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:57:16,668 INFO L225 Difference]: With dead ends: 132 [2024-11-10 06:57:16,668 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 06:57:16,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:57:16,670 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:57:16,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 176 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-10 06:57:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 06:57:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-10 06:57:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 06:57:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-11-10 06:57:16,697 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 94 [2024-11-10 06:57:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:57:16,698 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-11-10 06:57:16,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 06:57:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-11-10 06:57:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 06:57:16,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:57:16,700 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:57:16,711 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-10 06:57:16,904 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-10 06:57:16,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:57:16,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:57:16,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2094016996, now seen corresponding path program 1 times [2024-11-10 06:57:16,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:57:16,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683114234] [2024-11-10 06:57:16,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:57:16,907 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-10 06:57:16,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:57:16,910 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-10 06:57:16,912 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-10 06:57:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:57:17,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:57:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:57:17,254 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-10 06:57:17,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1668183449] [2024-11-10 06:57:17,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:57:17,255 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 06:57:17,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 06:57:17,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 06:57:17,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-10 06:57:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:57:17,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 06:57:17,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:58:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 06:58:01,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:58:01,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:58:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683114234] [2024-11-10 06:58:01,958 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 06:58:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1668183449] [2024-11-10 06:58:01,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1668183449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:58:01,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:58:01,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 06:58:01,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574248994] [2024-11-10 06:58:01,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:58:01,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 06:58:01,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:58:01,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 06:58:01,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:58:01,961 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 06:58:14,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:58:16,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:58:19,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:58:27,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:58:27,639 INFO L93 Difference]: Finished difference Result 135 states and 178 transitions. [2024-11-10 06:58:27,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 06:58:27,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-10 06:58:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:58:27,649 INFO L225 Difference]: With dead ends: 135 [2024-11-10 06:58:27,649 INFO L226 Difference]: Without dead ends: 132 [2024-11-10 06:58:27,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-10 06:58:27,650 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 74 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2024-11-10 06:58:27,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 342 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 21.5s Time] [2024-11-10 06:58:27,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-10 06:58:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2024-11-10 06:58:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 85 states have internal predecessors, (97), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 06:58:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 165 transitions. [2024-11-10 06:58:27,670 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 165 transitions. Word has length 94 [2024-11-10 06:58:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:58:27,671 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 165 transitions. [2024-11-10 06:58:27,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 06:58:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 165 transitions. [2024-11-10 06:58:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 06:58:27,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:58:27,673 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:58:27,689 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-10 06:58:27,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-10 06:58:28,074 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 06:58:28,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:58:28,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:58:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash 297065637, now seen corresponding path program 1 times [2024-11-10 06:58:28,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:58:28,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795331967] [2024-11-10 06:58:28,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:58:28,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-10 06:58:28,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:58:28,078 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-10 06:58:28,079 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-10 06:58:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:58:28,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 06:58:28,247 INFO L278 TraceCheckSpWp]: Computing forward predicates...