./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_has-floats_file-23.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 7e20287594d7bda057cc8987462fe4bc20fb41928eadfc70690547ace3b60f57 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:36:26,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:36:26,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:36:26,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:36:26,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:36:26,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:36:26,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:36:26,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:36:26,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:36:26,464 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:36:26,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:36:26,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:36:26,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:36:26,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:36:26,466 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:36:26,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:36:26,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:36:26,467 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:36:26,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:36:26,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:36:26,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:36:26,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:36:26,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:36:26,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:36:26,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:36:26,470 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:36:26,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:36:26,471 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:36:26,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:36:26,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:36:26,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:36:26,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:36:26,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:36:26,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:36:26,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:36:26,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:36:26,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:36:26,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:36:26,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:36:26,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:36:26,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:36:26,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:36:26,477 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 -> 7e20287594d7bda057cc8987462fe4bc20fb41928eadfc70690547ace3b60f57 [2024-11-16 15:36:26,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:36:26,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:36:26,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:36:26,753 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:36:26,753 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:36:26,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-23.i [2024-11-16 15:36:28,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:36:28,393 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:36:28,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-23.i [2024-11-16 15:36:28,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffdc92f51/27b19914b3da4ef4b6d4e2ba2165efd5/FLAGbe3002171 [2024-11-16 15:36:28,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffdc92f51/27b19914b3da4ef4b6d4e2ba2165efd5 [2024-11-16 15:36:28,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:36:28,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:36:28,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:36:28,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:36:28,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:36:28,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:36:28" (1/1) ... [2024-11-16 15:36:28,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a25f4ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28, skipping insertion in model container [2024-11-16 15:36:28,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:36:28" (1/1) ... [2024-11-16 15:36:28,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:36:28,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-23.i[917,930] [2024-11-16 15:36:28,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:36:28,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:36:28,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-23.i[917,930] [2024-11-16 15:36:28,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:36:28,817 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:36:28,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28 WrapperNode [2024-11-16 15:36:28,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:36:28,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:36:28,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:36:28,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:36:28,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28" (1/1) ... [2024-11-16 15:36:28,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28" (1/1) ... [2024-11-16 15:36:28,865 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-16 15:36:28,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:36:28,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:36:28,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:36:28,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:36:28,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28" (1/1) ... [2024-11-16 15:36:28,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28" (1/1) ... [2024-11-16 15:36:28,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28" (1/1) ... [2024-11-16 15:36:28,895 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-16 15:36:28,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28" (1/1) ... [2024-11-16 15:36:28,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28" (1/1) ... [2024-11-16 15:36:28,901 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28" (1/1) ... [2024-11-16 15:36:28,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28" (1/1) ... [2024-11-16 15:36:28,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28" (1/1) ... [2024-11-16 15:36:28,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28" (1/1) ... [2024-11-16 15:36:28,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:36:28,907 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:36:28,908 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:36:28,908 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:36:28,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28" (1/1) ... [2024-11-16 15:36:28,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:36:28,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:36:28,958 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-16 15:36:28,960 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-16 15:36:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:36:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:36:29,006 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:36:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:36:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:36:29,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:36:29,091 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:36:29,093 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:36:29,397 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 15:36:29,400 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:36:29,419 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:36:29,419 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:36:29,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:36:29 BoogieIcfgContainer [2024-11-16 15:36:29,420 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:36:29,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:36:29,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:36:29,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:36:29,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:36:28" (1/3) ... [2024-11-16 15:36:29,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145f908b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:36:29, skipping insertion in model container [2024-11-16 15:36:29,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:28" (2/3) ... [2024-11-16 15:36:29,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145f908b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:36:29, skipping insertion in model container [2024-11-16 15:36:29,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:36:29" (3/3) ... [2024-11-16 15:36:29,430 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-23.i [2024-11-16 15:36:29,446 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:36:29,446 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:36:29,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:36:29,527 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;@3e31084a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:36:29,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:36:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:36:29,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 15:36:29,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:29,547 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:36:29,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:29,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:29,552 INFO L85 PathProgramCache]: Analyzing trace with hash 697320217, now seen corresponding path program 1 times [2024-11-16 15:36:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:29,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390112666] [2024-11-16 15:36:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:29,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:36:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:36:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:36:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:36:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:36:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:36:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:36:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:36:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:36:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 15:36:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 15:36:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 15:36:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 15:36:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 15:36:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 15:36:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 15:36:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 15:36:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 15:36:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 15:36:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:36:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:36:29,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:36:29,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390112666] [2024-11-16 15:36:29,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390112666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:29,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:29,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:36:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686945337] [2024-11-16 15:36:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:29,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:36:29,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:36:29,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:36:29,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:36:29,991 INFO L87 Difference]: Start difference. First operand has 60 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:36:30,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:30,026 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2024-11-16 15:36:30,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:36:30,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 127 [2024-11-16 15:36:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:30,038 INFO L225 Difference]: With dead ends: 112 [2024-11-16 15:36:30,038 INFO L226 Difference]: Without dead ends: 55 [2024-11-16 15:36:30,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-16 15:36:30,045 INFO L432 NwaCegarLoop]: 79 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, 79 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-16 15:36:30,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:36:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-16 15:36:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-16 15:36:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:36:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2024-11-16 15:36:30,125 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 127 [2024-11-16 15:36:30,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:30,126 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2024-11-16 15:36:30,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:36:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2024-11-16 15:36:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 15:36:30,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:30,153 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:36:30,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:36:30,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:30,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash -450680201, now seen corresponding path program 1 times [2024-11-16 15:36:30,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:30,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312694720] [2024-11-16 15:36:30,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:30,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:36:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:36:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:36:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:36:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:36:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:36:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:36:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:36:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:36:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 15:36:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 15:36:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 15:36:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 15:36:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 15:36:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 15:36:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 15:36:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 15:36:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 15:36:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 15:36:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:36:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 15:36:30,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:36:30,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312694720] [2024-11-16 15:36:30,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312694720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:30,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:30,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 15:36:30,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413890441] [2024-11-16 15:36:30,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:30,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 15:36:30,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:36:30,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 15:36:30,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 15:36:30,997 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:36:31,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:31,474 INFO L93 Difference]: Finished difference Result 163 states and 230 transitions. [2024-11-16 15:36:31,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 15:36:31,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-11-16 15:36:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:31,478 INFO L225 Difference]: With dead ends: 163 [2024-11-16 15:36:31,478 INFO L226 Difference]: Without dead ends: 111 [2024-11-16 15:36:31,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-16 15:36:31,482 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 102 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:36:31,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 226 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 15:36:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-16 15:36:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 62. [2024-11-16 15:36:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:36:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2024-11-16 15:36:31,506 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 127 [2024-11-16 15:36:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:31,508 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2024-11-16 15:36:31,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:36:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2024-11-16 15:36:31,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 15:36:31,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:31,512 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:36:31,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:36:31,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:31,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:31,513 INFO L85 PathProgramCache]: Analyzing trace with hash 436823480, now seen corresponding path program 1 times [2024-11-16 15:36:31,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:31,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430051328] [2024-11-16 15:36:31,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:31,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:36:31,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517430860] [2024-11-16 15:36:31,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:31,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:36:31,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:36:31,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:36:31,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 15:36:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:36:31,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:36:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:36:31,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:36:31,901 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:36:31,902 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:36:31,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 15:36:32,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:36:32,107 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 15:36:32,211 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:36:32,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:36:32 BoogieIcfgContainer [2024-11-16 15:36:32,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:36:32,216 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:36:32,216 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:36:32,216 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:36:32,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:36:29" (3/4) ... [2024-11-16 15:36:32,219 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:36:32,220 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:36:32,221 INFO L158 Benchmark]: Toolchain (without parser) took 3802.32ms. Allocated memory was 157.3MB in the beginning and 224.4MB in the end (delta: 67.1MB). Free memory was 85.7MB in the beginning and 133.8MB in the end (delta: -48.1MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-11-16 15:36:32,223 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory was 111.4MB in the beginning and 111.3MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:36:32,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.78ms. Allocated memory is still 157.3MB. Free memory was 85.6MB in the beginning and 128.8MB in the end (delta: -43.3MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-11-16 15:36:32,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.77ms. Allocated memory is still 157.3MB. Free memory was 128.8MB in the beginning and 126.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:36:32,223 INFO L158 Benchmark]: Boogie Preprocessor took 40.31ms. Allocated memory is still 157.3MB. Free memory was 126.7MB in the beginning and 124.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:36:32,224 INFO L158 Benchmark]: IcfgBuilder took 512.88ms. Allocated memory is still 157.3MB. Free memory was 124.3MB in the beginning and 107.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 15:36:32,227 INFO L158 Benchmark]: TraceAbstraction took 2792.95ms. Allocated memory was 157.3MB in the beginning and 224.4MB in the end (delta: 67.1MB). Free memory was 106.7MB in the beginning and 133.8MB in the end (delta: -27.2MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-11-16 15:36:32,227 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 224.4MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:36:32,229 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.19ms. Allocated memory is still 157.3MB. Free memory was 111.4MB in the beginning and 111.3MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.78ms. Allocated memory is still 157.3MB. Free memory was 85.6MB in the beginning and 128.8MB in the end (delta: -43.3MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.77ms. Allocated memory is still 157.3MB. Free memory was 128.8MB in the beginning and 126.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.31ms. Allocated memory is still 157.3MB. Free memory was 126.7MB in the beginning and 124.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 512.88ms. Allocated memory is still 157.3MB. Free memory was 124.3MB in the beginning and 107.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2792.95ms. Allocated memory was 157.3MB in the beginning and 224.4MB in the end (delta: 67.1MB). Free memory was 106.7MB in the beginning and 133.8MB in the end (delta: -27.2MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 224.4MB. Free memory is still 133.8MB. 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 someBinaryFLOATComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 0; [L23] unsigned long int var_1_2 = 16; [L24] unsigned long int var_1_3 = 64; [L25] unsigned long int var_1_4 = 25; [L26] float var_1_5 = 1.2; [L27] float var_1_6 = 999.7; [L28] float var_1_7 = 1.4; [L29] float var_1_8 = 9.75; [L30] float var_1_9 = 1.75; [L31] unsigned long int var_1_10 = 16; [L32] unsigned long int var_1_11 = 1277342739; [L33] unsigned long int var_1_12 = 1394088949; [L34] unsigned long int var_1_13 = 0; [L35] unsigned char var_1_14 = 0; [L36] unsigned char var_1_17 = 0; [L37] unsigned char var_1_18 = 0; [L38] unsigned char var_1_19 = 0; VAL [isInitial=0, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=16, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] FCALL updateLastVariables() [L106] CALL updateVariables() [L62] var_1_2 = __VERIFIER_nondet_ulong() [L63] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L63] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L64] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L64] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L65] var_1_3 = __VERIFIER_nondet_ulong() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L67] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L67] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L68] var_1_5 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L69] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L70] var_1_6 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L71] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L72] CALL assume_abort_if_not(var_1_6 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L72] RET assume_abort_if_not(var_1_6 != 0.0F) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L73] var_1_7 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_8=39/4, var_1_9=7/4] [L74] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_8=39/4, var_1_9=7/4] [L75] var_1_8 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_9=7/4] [L76] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_9=7/4] [L77] var_1_9 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L78] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L79] var_1_11 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L80] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L81] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L81] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L82] var_1_12 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_12 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L83] RET assume_abort_if_not(var_1_12 >= 1073741824) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L84] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L84] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L85] var_1_13 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L86] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L87] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L87] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L88] var_1_17 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L89] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L90] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L90] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L91] var_1_19 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L93] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L93] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L106] RET updateVariables() [L107] CALL step() [L42] var_1_1 = ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L43] COND TRUE (var_1_5 / var_1_6) <= (var_1_7 + (var_1_8 - var_1_9)) [L44] var_1_4 = ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L46] var_1_10 = ((((var_1_2) > (((var_1_11 + var_1_12) - var_1_13))) ? (var_1_2) : (((var_1_11 + var_1_12) - var_1_13)))) [L47] unsigned char stepLocal_0 = (- var_1_5) != 1.9f; VAL [isInitial=1, stepLocal_0=0, var_1_10=2147483647, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L48] COND FALSE !(stepLocal_0 || ((var_1_4 * var_1_13) < var_1_3)) [L51] var_1_18 = var_1_19 VAL [isInitial=1, var_1_10=2147483647, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L53] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, var_1_10=2147483647, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((var_1_1 == ((unsigned long int) ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) && (((var_1_5 / var_1_6) <= (var_1_7 + (var_1_8 - var_1_9))) ? (var_1_4 == ((unsigned long int) ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1)) && (var_1_10 == ((unsigned long int) ((((var_1_2) > (((var_1_11 + var_1_12) - var_1_13))) ? (var_1_2) : (((var_1_11 + var_1_12) - var_1_13))))))) && (var_1_18 ? ((! ((var_1_5 / var_1_6) < (var_1_8 - var_1_9))) ? (var_1_18 ? (var_1_14 == ((unsigned char) (! var_1_17))) : 1) : 1) : 1)) && ((((- var_1_5) != 1.9f) || ((var_1_4 * var_1_13) < var_1_3)) ? (var_1_18 == ((unsigned char) (! var_1_19))) : (var_1_18 == ((unsigned char) var_1_19))) ; VAL [\result=0, isInitial=1, var_1_10=2147483647, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2147483647, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2147483647, var_1_11=1073741823, var_1_12=1073741824, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 305 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 265 IncrementalHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 170 mSDtfsCounter, 265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=2, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 49 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 508 NumberOfCodeBlocks, 508 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1520/1520 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-16 15:36:32,263 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_has-floats_file-23.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 7e20287594d7bda057cc8987462fe4bc20fb41928eadfc70690547ace3b60f57 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:36:34,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:36:34,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:36:34,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:36:34,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:36:34,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:36:34,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:36:34,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:36:34,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:36:34,581 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:36:34,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:36:34,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:36:34,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:36:34,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:36:34,585 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:36:34,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:36:34,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:36:34,586 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:36:34,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:36:34,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:36:34,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:36:34,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:36:34,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:36:34,589 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:36:34,589 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:36:34,590 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:36:34,591 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:36:34,591 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:36:34,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:36:34,591 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:36:34,592 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:36:34,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:36:34,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:36:34,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:36:34,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:36:34,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:36:34,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:36:34,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:36:34,595 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:36:34,595 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:36:34,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:36:34,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:36:34,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:36:34,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:36:34,596 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 -> 7e20287594d7bda057cc8987462fe4bc20fb41928eadfc70690547ace3b60f57 [2024-11-16 15:36:34,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:36:34,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:36:34,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:36:34,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:36:34,968 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:36:34,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-23.i [2024-11-16 15:36:36,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:36:36,644 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:36:36,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-23.i [2024-11-16 15:36:36,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02442a6a5/a2101df7762b4e519d97555ce45ff9ef/FLAG49dfad365 [2024-11-16 15:36:36,676 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02442a6a5/a2101df7762b4e519d97555ce45ff9ef [2024-11-16 15:36:36,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:36:36,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:36:36,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:36:36,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:36:36,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:36:36,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:36:36" (1/1) ... [2024-11-16 15:36:36,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b04e52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:36, skipping insertion in model container [2024-11-16 15:36:36,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:36:36" (1/1) ... [2024-11-16 15:36:36,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:36:36,907 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-23.i[917,930] [2024-11-16 15:36:36,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:36:37,005 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:36:37,021 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-23.i[917,930] [2024-11-16 15:36:37,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:36:37,065 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:36:37,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:37 WrapperNode [2024-11-16 15:36:37,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:36:37,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:36:37,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:36:37,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:36:37,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:37" (1/1) ... [2024-11-16 15:36:37,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:37" (1/1) ... [2024-11-16 15:36:37,125 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-16 15:36:37,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:36:37,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:36:37,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:36:37,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:36:37,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:37" (1/1) ... [2024-11-16 15:36:37,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:37" (1/1) ... [2024-11-16 15:36:37,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:37" (1/1) ... [2024-11-16 15:36:37,161 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-16 15:36:37,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:37" (1/1) ... [2024-11-16 15:36:37,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:37" (1/1) ... [2024-11-16 15:36:37,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:37" (1/1) ... [2024-11-16 15:36:37,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:37" (1/1) ... [2024-11-16 15:36:37,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:37" (1/1) ... [2024-11-16 15:36:37,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:37" (1/1) ... [2024-11-16 15:36:37,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:36:37,190 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:36:37,190 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:36:37,190 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:36:37,191 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:37" (1/1) ... [2024-11-16 15:36:37,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:36:37,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:36:37,230 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-16 15:36:37,234 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-16 15:36:37,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:36:37,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:36:37,276 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:36:37,276 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:36:37,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:36:37,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:36:37,353 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:36:37,355 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:36:45,056 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 15:36:45,057 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:36:45,069 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:36:45,070 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:36:45,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:36:45 BoogieIcfgContainer [2024-11-16 15:36:45,078 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:36:45,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:36:45,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:36:45,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:36:45,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:36:36" (1/3) ... [2024-11-16 15:36:45,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426c28d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:36:45, skipping insertion in model container [2024-11-16 15:36:45,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:37" (2/3) ... [2024-11-16 15:36:45,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426c28d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:36:45, skipping insertion in model container [2024-11-16 15:36:45,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:36:45" (3/3) ... [2024-11-16 15:36:45,089 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-23.i [2024-11-16 15:36:45,105 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:36:45,106 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:36:45,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:36:45,175 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;@8cbf6ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:36:45,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:36:45,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:36:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 15:36:45,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:45,195 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:36:45,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:45,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:45,202 INFO L85 PathProgramCache]: Analyzing trace with hash 697320217, now seen corresponding path program 1 times [2024-11-16 15:36:45,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:36:45,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381285971] [2024-11-16 15:36:45,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:45,216 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-16 15:36:45,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:36:45,220 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-16 15:36:45,221 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-16 15:36:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:45,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:36:45,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:36:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-16 15:36:45,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:36:45,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:36:45,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381285971] [2024-11-16 15:36:45,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381285971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:45,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:45,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:36:45,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982327618] [2024-11-16 15:36:45,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:45,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:36:45,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:36:45,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:36:45,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:36:45,751 INFO L87 Difference]: Start difference. First operand has 60 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:36:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:45,784 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2024-11-16 15:36:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:36:45,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 127 [2024-11-16 15:36:45,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:45,792 INFO L225 Difference]: With dead ends: 112 [2024-11-16 15:36:45,792 INFO L226 Difference]: Without dead ends: 55 [2024-11-16 15:36:45,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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-16 15:36:45,798 INFO L432 NwaCegarLoop]: 79 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, 79 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-16 15:36:45,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:36:45,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-16 15:36:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-16 15:36:45,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:36:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2024-11-16 15:36:45,834 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 127 [2024-11-16 15:36:45,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:45,834 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2024-11-16 15:36:45,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:36:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2024-11-16 15:36:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 15:36:45,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:45,838 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:36:45,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 15:36:46,038 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-16 15:36:46,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:46,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:46,040 INFO L85 PathProgramCache]: Analyzing trace with hash -450680201, now seen corresponding path program 1 times [2024-11-16 15:36:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:36:46,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059766228] [2024-11-16 15:36:46,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:46,042 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-16 15:36:46,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:36:46,044 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-16 15:36:46,045 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-16 15:36:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:46,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 15:36:46,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:36:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 15:36:46,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:36:46,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:36:46,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059766228] [2024-11-16 15:36:46,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059766228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:46,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:46,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 15:36:46,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119806258] [2024-11-16 15:36:46,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:46,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 15:36:46,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:36:46,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 15:36:46,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 15:36:46,724 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:36:50,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:36:51,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:36:52,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:52,571 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2024-11-16 15:36:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 15:36:52,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-11-16 15:36:52,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:52,577 INFO L225 Difference]: With dead ends: 175 [2024-11-16 15:36:52,577 INFO L226 Difference]: Without dead ends: 123 [2024-11-16 15:36:52,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-16 15:36:52,580 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 101 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:36:52,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 260 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-16 15:36:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-16 15:36:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 62. [2024-11-16 15:36:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:36:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2024-11-16 15:36:52,602 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 127 [2024-11-16 15:36:52,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:52,603 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2024-11-16 15:36:52,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:36:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2024-11-16 15:36:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 15:36:52,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:52,605 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:36:52,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 15:36:52,806 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-16 15:36:52,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:52,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:52,807 INFO L85 PathProgramCache]: Analyzing trace with hash 436823480, now seen corresponding path program 1 times [2024-11-16 15:36:52,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:36:52,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246510699] [2024-11-16 15:36:52,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:52,808 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-16 15:36:52,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:36:52,810 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-16 15:36:52,811 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-16 15:36:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:53,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 15:36:53,136 INFO L278 TraceCheckSpWp]: Computing forward predicates...