./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.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 673f48eff2c9fa553be4e6ec558f63c53157e8de398373430e9065fe538627b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:42:58,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:42:58,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:42:58,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:42:58,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:42:58,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:42:58,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:42:58,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:42:58,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:42:58,467 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:42:58,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:42:58,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:42:58,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:42:58,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:42:58,470 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:42:58,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:42:58,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:42:58,471 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:42:58,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:42:58,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:42:58,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:42:58,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:42:58,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:42:58,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:42:58,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:42:58,475 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:42:58,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:42:58,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:42:58,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:42:58,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:42:58,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:42:58,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:42:58,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:42:58,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:42:58,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:42:58,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:42:58,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:42:58,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:42:58,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:42:58,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:42:58,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:42:58,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:42:58,480 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 -> 673f48eff2c9fa553be4e6ec558f63c53157e8de398373430e9065fe538627b8 [2024-11-10 09:42:58,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:42:58,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:42:58,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:42:58,731 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:42:58,737 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:42:58,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i [2024-11-10 09:43:00,234 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:43:00,383 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:43:00,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i [2024-11-10 09:43:00,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4b933bf3/5a0a48a12e6b4f5dab72cde9629d4534/FLAGce85e445b [2024-11-10 09:43:00,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4b933bf3/5a0a48a12e6b4f5dab72cde9629d4534 [2024-11-10 09:43:00,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:43:00,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:43:00,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:43:00,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:43:00,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:43:00,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:43:00" (1/1) ... [2024-11-10 09:43:00,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00, skipping insertion in model container [2024-11-10 09:43:00,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:43:00" (1/1) ... [2024-11-10 09:43:00,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:43:00,539 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_variablewrapping_wrapper-s_file-0.i[915,928] [2024-11-10 09:43:00,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:43:00,589 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:43:00,602 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_variablewrapping_wrapper-s_file-0.i[915,928] [2024-11-10 09:43:00,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:43:00,679 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:43:00,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00 WrapperNode [2024-11-10 09:43:00,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:43:00,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:43:00,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:43:00,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:43:00,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00" (1/1) ... [2024-11-10 09:43:00,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00" (1/1) ... [2024-11-10 09:43:00,728 INFO L138 Inliner]: procedures = 29, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 358 [2024-11-10 09:43:00,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:43:00,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:43:00,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:43:00,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:43:00,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00" (1/1) ... [2024-11-10 09:43:00,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00" (1/1) ... [2024-11-10 09:43:00,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00" (1/1) ... [2024-11-10 09:43:00,769 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-11-10 09:43:00,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00" (1/1) ... [2024-11-10 09:43:00,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00" (1/1) ... [2024-11-10 09:43:00,781 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00" (1/1) ... [2024-11-10 09:43:00,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00" (1/1) ... [2024-11-10 09:43:00,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00" (1/1) ... [2024-11-10 09:43:00,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00" (1/1) ... [2024-11-10 09:43:00,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:43:00,787 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:43:00,787 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:43:00,787 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:43:00,788 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00" (1/1) ... [2024-11-10 09:43:00,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:43:00,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:43:00,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:43:00,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:43:00,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:43:00,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:43:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:43:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:43:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:43:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:43:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:43:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:43:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:43:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:43:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:43:00,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:43:00,861 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:43:00,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:43:00,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:43:00,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:43:00,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:43:00,956 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:43:00,959 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:43:01,199 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~mem54#1;havoc property_#t~ite62#1;havoc property_#t~mem57#1;havoc property_#t~mem55#1;havoc property_#t~mem56#1;havoc property_#t~mem61#1;havoc property_#t~mem58#1;havoc property_#t~ite60#1;havoc property_#t~mem59#1;havoc property_#t~mem65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem66#1;havoc property_#t~ite82#1;havoc property_#t~mem67#1;havoc property_#t~ite79#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite76#1;havoc property_#t~mem70#1;havoc property_#t~ite73#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~short83#1;havoc property_#t~ite87#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~short95#1; [2024-11-10 09:43:01,225 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-10 09:43:01,226 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:43:01,248 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:43:01,249 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:43:01,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:43:01 BoogieIcfgContainer [2024-11-10 09:43:01,250 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:43:01,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:43:01,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:43:01,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:43:01,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:43:00" (1/3) ... [2024-11-10 09:43:01,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57232cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:43:01, skipping insertion in model container [2024-11-10 09:43:01,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:00" (2/3) ... [2024-11-10 09:43:01,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57232cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:43:01, skipping insertion in model container [2024-11-10 09:43:01,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:43:01" (3/3) ... [2024-11-10 09:43:01,258 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-0.i [2024-11-10 09:43:01,271 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:43:01,271 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:43:01,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:43:01,323 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;@15f9c916, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:43:01,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:43:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:43:01,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 09:43:01,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:43:01,343 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:43:01,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:43:01,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:43:01,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1915253092, now seen corresponding path program 1 times [2024-11-10 09:43:01,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:43:01,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267618691] [2024-11-10 09:43:01,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:43:01,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:43:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:43:01,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:43:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:43:01,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:43:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:43:01,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:43:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:43:01,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:43:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:43:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:43:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:43:01,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:43:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:43:01,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:43:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:43:01,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:43:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:43:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:43:01,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:43:01,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267618691] [2024-11-10 09:43:01,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267618691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:43:01,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:43:01,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:43:01,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370348640] [2024-11-10 09:43:01,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:43:01,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:43:01,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:43:01,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:43:01,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:43:01,614 INFO L87 Difference]: Start difference. First operand has 88 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 09:43:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:43:01,634 INFO L93 Difference]: Finished difference Result 165 states and 250 transitions. [2024-11-10 09:43:01,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:43:01,639 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2024-11-10 09:43:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:43:01,644 INFO L225 Difference]: With dead ends: 165 [2024-11-10 09:43:01,645 INFO L226 Difference]: Without dead ends: 80 [2024-11-10 09:43:01,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:43:01,650 INFO L432 NwaCegarLoop]: 110 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, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:43:01,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:43:01,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-10 09:43:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-10 09:43:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:43:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2024-11-10 09:43:01,712 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 80 [2024-11-10 09:43:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:43:01,713 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2024-11-10 09:43:01,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 09:43:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2024-11-10 09:43:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 09:43:01,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:43:01,718 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:43:01,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:43:01,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:43:01,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:43:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1375936118, now seen corresponding path program 1 times [2024-11-10 09:43:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:43:01,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175571192] [2024-11-10 09:43:01,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:43:01,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:43:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:43:01,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:43:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:43:01,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:43:01,930 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:43:01,932 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:43:01,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:43:01,936 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 09:43:01,976 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:43:01,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:43:01 BoogieIcfgContainer [2024-11-10 09:43:01,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:43:01,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:43:01,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:43:01,981 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:43:01,981 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:43:01" (3/4) ... [2024-11-10 09:43:01,983 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:43:01,984 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:43:01,985 INFO L158 Benchmark]: Toolchain (without parser) took 1582.01ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 93.5MB in the beginning and 171.0MB in the end (delta: -77.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:43:01,985 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 120.5MB in the end (delta: 155.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:43:01,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.36ms. Allocated memory is still 167.8MB. Free memory was 93.4MB in the beginning and 134.5MB in the end (delta: -41.1MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-11-10 09:43:01,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.65ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 136.2MB in the end (delta: -1.8MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2024-11-10 09:43:01,987 INFO L158 Benchmark]: Boogie Preprocessor took 57.67ms. Allocated memory is still 167.8MB. Free memory was 136.2MB in the beginning and 133.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:43:01,987 INFO L158 Benchmark]: IcfgBuilder took 463.02ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 107.9MB in the end (delta: 25.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 09:43:01,987 INFO L158 Benchmark]: TraceAbstraction took 728.30ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 106.9MB in the beginning and 172.0MB in the end (delta: -65.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:43:01,988 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 226.5MB. Free memory is still 171.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:43:01,989 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.25ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 120.5MB in the end (delta: 155.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.36ms. Allocated memory is still 167.8MB. Free memory was 93.4MB in the beginning and 134.5MB in the end (delta: -41.1MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.65ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 136.2MB in the end (delta: -1.8MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.67ms. Allocated memory is still 167.8MB. Free memory was 136.2MB in the beginning and 133.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 463.02ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 107.9MB in the end (delta: 25.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 728.30ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 106.9MB in the beginning and 172.0MB in the end (delta: -65.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 226.5MB. Free memory is still 171.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 62. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L45] double last_1_WrapperStruct0_var_1_5 = 5.25; [L46] unsigned char last_1_WrapperStruct0_var_1_10 = 100; [L47] unsigned short int last_1_WrapperStruct0_var_1_13 = 5; VAL [WrapperStruct0={4:0}, isInitial=0, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L98] EXPR WrapperStruct0.var_1_5 [L98] last_1_WrapperStruct0_var_1_5 = WrapperStruct0.var_1_5 [L99] EXPR WrapperStruct0.var_1_10 [L99] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L100] EXPR WrapperStruct0.var_1_13 [L100] last_1_WrapperStruct0_var_1_13 = WrapperStruct0.var_1_13 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L83] WrapperStruct0.var_1_2 = __VERIFIER_nondet_uchar() [L84] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L84] CALL assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L84] RET assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L85] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L85] CALL assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L85] RET assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L86] WrapperStruct0.var_1_3 = __VERIFIER_nondet_double() [L87] EXPR WrapperStruct0.var_1_3 [L87] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F [L87] EXPR WrapperStruct0.var_1_3 [L87] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] CALL assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] RET assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L88] WrapperStruct0.var_1_4 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct0.var_1_4 [L89] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F [L89] EXPR WrapperStruct0.var_1_4 [L89] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] CALL assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] RET assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L90] WrapperStruct0.var_1_9 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L91] CALL assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L91] RET assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L92] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L93] WrapperStruct0.var_1_12 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] CALL assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] RET assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L95] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L95] CALL assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L95] RET assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L111] RET updateVariables() [L112] CALL step() [L51] WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L51] COND FALSE !(WrapperStruct0.var_1_9) [L56] COND FALSE !((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L61] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L61] COND TRUE ! WrapperStruct0.var_1_2 [L62] EXPR WrapperStruct0.var_1_3 [L62] EXPR WrapperStruct0.var_1_4 [L62] WrapperStruct0.var_1_1 = (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4) [L66] EXPR WrapperStruct0.var_1_3 [L66] EXPR WrapperStruct0.var_1_4 [L66] EXPR WrapperStruct0.var_1_1 [L66] EXPR WrapperStruct0.var_1_1 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L66] COND FALSE !((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) [L79] EXPR WrapperStruct0.var_1_3 [L79] WrapperStruct0.var_1_5 = WrapperStruct0.var_1_3 [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR (! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3))))) [L103] EXPR WrapperStruct0.var_1_1 [L103] EXPR WrapperStruct0.var_1_3 [L103] EXPR WrapperStruct0.var_1_4 [L103] EXPR (! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3))))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR ((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR ((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR (((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR (((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR ((((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1)) && (WrapperStruct0.var_1_9 ? (((WrapperStruct0.var_1_4 * (WrapperStruct0.var_1_3 - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? (WrapperStruct0.var_1_13 == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR ((((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1)) && (WrapperStruct0.var_1_9 ? (((WrapperStruct0.var_1_4 * (WrapperStruct0.var_1_3 - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? (WrapperStruct0.var_1_13 == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103-L104] return ((((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1)) && (WrapperStruct0.var_1_9 ? (((WrapperStruct0.var_1_4 * (WrapperStruct0.var_1_3 - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? (WrapperStruct0.var_1_13 == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L19] reach_error() VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 110 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 79 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 112/112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:43:02,016 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_variablewrapping_wrapper-s_file-0.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 673f48eff2c9fa553be4e6ec558f63c53157e8de398373430e9065fe538627b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:43:04,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:43:04,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:43:04,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:43:04,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:43:04,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:43:04,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:43:04,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:43:04,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:43:04,452 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:43:04,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:43:04,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:43:04,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:43:04,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:43:04,454 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:43:04,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:43:04,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:43:04,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:43:04,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:43:04,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:43:04,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:43:04,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:43:04,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:43:04,459 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:43:04,459 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:43:04,459 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:43:04,459 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:43:04,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:43:04,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:43:04,460 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:43:04,460 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:43:04,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:43:04,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:43:04,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:43:04,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:43:04,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:43:04,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:43:04,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:43:04,462 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:43:04,463 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:43:04,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:43:04,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:43:04,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:43:04,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:43:04,463 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 -> 673f48eff2c9fa553be4e6ec558f63c53157e8de398373430e9065fe538627b8 [2024-11-10 09:43:04,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:43:04,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:43:04,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:43:04,812 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:43:04,813 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:43:04,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i [2024-11-10 09:43:06,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:43:06,476 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:43:06,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i [2024-11-10 09:43:06,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aabfd7815/26090c25efcd4835a510554a7c21014a/FLAGb57f81b89 [2024-11-10 09:43:06,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aabfd7815/26090c25efcd4835a510554a7c21014a [2024-11-10 09:43:06,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:43:06,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:43:06,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:43:06,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:43:06,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:43:06,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:43:06" (1/1) ... [2024-11-10 09:43:06,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df30dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06, skipping insertion in model container [2024-11-10 09:43:06,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:43:06" (1/1) ... [2024-11-10 09:43:06,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:43:06,713 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_variablewrapping_wrapper-s_file-0.i[915,928] [2024-11-10 09:43:06,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:43:06,788 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:43:06,801 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_variablewrapping_wrapper-s_file-0.i[915,928] [2024-11-10 09:43:06,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:43:06,850 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:43:06,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06 WrapperNode [2024-11-10 09:43:06,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:43:06,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:43:06,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:43:06,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:43:06,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06" (1/1) ... [2024-11-10 09:43:06,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06" (1/1) ... [2024-11-10 09:43:06,921 INFO L138 Inliner]: procedures = 33, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 358 [2024-11-10 09:43:06,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:43:06,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:43:06,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:43:06,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:43:06,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06" (1/1) ... [2024-11-10 09:43:06,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06" (1/1) ... [2024-11-10 09:43:06,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06" (1/1) ... [2024-11-10 09:43:06,963 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-11-10 09:43:06,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06" (1/1) ... [2024-11-10 09:43:06,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06" (1/1) ... [2024-11-10 09:43:06,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06" (1/1) ... [2024-11-10 09:43:06,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06" (1/1) ... [2024-11-10 09:43:06,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06" (1/1) ... [2024-11-10 09:43:06,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06" (1/1) ... [2024-11-10 09:43:07,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:43:07,005 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:43:07,006 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:43:07,006 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:43:07,007 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06" (1/1) ... [2024-11-10 09:43:07,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:43:07,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:43:07,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:43:07,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:43:07,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:43:07,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-10 09:43:07,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-10 09:43:07,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-10 09:43:07,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-10 09:43:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:43:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:43:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-10 09:43:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-10 09:43:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:43:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:43:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-10 09:43:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-10 09:43:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-10 09:43:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-10 09:43:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:43:07,086 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:43:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:43:07,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:43:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:43:07,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:43:07,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-10 09:43:07,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-10 09:43:07,188 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:43:07,190 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:43:26,167 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~mem54#1;havoc property_#t~ite62#1;havoc property_#t~mem57#1;havoc property_#t~mem55#1;havoc property_#t~mem56#1;havoc property_#t~mem61#1;havoc property_#t~mem58#1;havoc property_#t~ite60#1;havoc property_#t~mem59#1;havoc property_#t~mem65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem66#1;havoc property_#t~ite82#1;havoc property_#t~mem67#1;havoc property_#t~ite79#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite76#1;havoc property_#t~mem70#1;havoc property_#t~ite73#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~short83#1;havoc property_#t~ite87#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~short95#1; [2024-11-10 09:43:26,181 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-11-10 09:43:26,181 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:43:26,206 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:43:26,207 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:43:26,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:43:26 BoogieIcfgContainer [2024-11-10 09:43:26,207 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:43:26,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:43:26,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:43:26,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:43:26,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:43:06" (1/3) ... [2024-11-10 09:43:26,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1adb6cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:43:26, skipping insertion in model container [2024-11-10 09:43:26,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:43:06" (2/3) ... [2024-11-10 09:43:26,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1adb6cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:43:26, skipping insertion in model container [2024-11-10 09:43:26,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:43:26" (3/3) ... [2024-11-10 09:43:26,223 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-0.i [2024-11-10 09:43:26,253 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:43:26,257 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:43:26,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:43:26,347 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;@7d4f4e23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:43:26,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:43:26,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:43:26,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 09:43:26,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:43:26,360 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:43:26,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:43:26,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:43:26,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1915253092, now seen corresponding path program 1 times [2024-11-10 09:43:26,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:43:26,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920197412] [2024-11-10 09:43:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:43:26,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:43:26,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:43:26,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:43:26,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 09:43:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:43:26,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:43:26,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:43:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-10 09:43:26,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:43:26,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:43:26,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920197412] [2024-11-10 09:43:26,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920197412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:43:26,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:43:26,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:43:26,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802582439] [2024-11-10 09:43:26,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:43:26,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:43:26,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:43:26,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:43:26,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:43:26,875 INFO L87 Difference]: Start difference. First operand has 88 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:43:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:43:26,892 INFO L93 Difference]: Finished difference Result 165 states and 250 transitions. [2024-11-10 09:43:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:43:26,894 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-11-10 09:43:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:43:26,899 INFO L225 Difference]: With dead ends: 165 [2024-11-10 09:43:26,899 INFO L226 Difference]: Without dead ends: 80 [2024-11-10 09:43:26,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:43:26,905 INFO L432 NwaCegarLoop]: 110 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, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:43:26,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:43:26,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-10 09:43:26,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-10 09:43:26,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:43:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2024-11-10 09:43:26,934 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 80 [2024-11-10 09:43:26,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:43:26,935 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2024-11-10 09:43:26,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 09:43:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2024-11-10 09:43:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 09:43:26,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:43:26,937 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:43:26,953 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-10 09:43:27,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:43:27,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:43:27,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:43:27,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1375936118, now seen corresponding path program 1 times [2024-11-10 09:43:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:43:27,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532311705] [2024-11-10 09:43:27,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:43:27,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:43:27,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:43:27,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:43:27,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 09:43:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:43:27,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:43:27,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:43:27,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:43:27,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-10 09:43:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-10 09:43:27,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:43:27,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:43:27,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532311705] [2024-11-10 09:43:27,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532311705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:43:27,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:43:27,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:43:27,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291906523] [2024-11-10 09:43:27,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:43:27,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:43:27,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:43:27,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:43:27,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:43:27,840 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 09:43:32,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:43:36,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:43:38,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:43:42,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 09:43:45,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:43:53,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:43:57,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:00,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:04,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:08,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:12,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:12,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:44:12,349 INFO L93 Difference]: Finished difference Result 158 states and 218 transitions. [2024-11-10 09:44:12,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:44:12,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2024-11-10 09:44:12,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:44:12,383 INFO L225 Difference]: With dead ends: 158 [2024-11-10 09:44:12,383 INFO L226 Difference]: Without dead ends: 81 [2024-11-10 09:44:12,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:44:12,385 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 94 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:44:12,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 292 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 44.4s Time] [2024-11-10 09:44:12,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-10 09:44:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-10 09:44:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:44:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2024-11-10 09:44:12,395 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 80 [2024-11-10 09:44:12,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:44:12,396 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2024-11-10 09:44:12,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 09:44:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2024-11-10 09:44:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:44:12,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:12,403 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:44:12,419 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-10 09:44:12,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:44:12,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:12,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:12,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2132640728, now seen corresponding path program 1 times [2024-11-10 09:44:12,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:44:12,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55666832] [2024-11-10 09:44:12,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:12,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:44:12,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:44:12,610 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:44:12,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 09:44:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:12,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:44:13,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:44:13,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:44:13,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-10 09:44:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-10 09:44:13,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:44:13,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:44:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55666832] [2024-11-10 09:44:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55666832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:44:13,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:44:13,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:44:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692741736] [2024-11-10 09:44:13,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:44:13,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:44:13,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:44:13,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:44:13,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:44:13,780 INFO L87 Difference]: Start difference. First operand 80 states and 109 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 09:44:18,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:22,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:24,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:26,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:27,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:29,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:30,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:34,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:38,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:39,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:39,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:44:39,569 INFO L93 Difference]: Finished difference Result 158 states and 216 transitions. [2024-11-10 09:44:39,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:44:39,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2024-11-10 09:44:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:44:39,604 INFO L225 Difference]: With dead ends: 158 [2024-11-10 09:44:39,604 INFO L226 Difference]: Without dead ends: 81 [2024-11-10 09:44:39,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:44:39,606 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 85 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:44:39,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 286 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 3 Unknown, 0 Unchecked, 25.7s Time] [2024-11-10 09:44:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-10 09:44:39,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-10 09:44:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 70 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:44:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. [2024-11-10 09:44:39,611 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 82 [2024-11-10 09:44:39,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:44:39,612 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. [2024-11-10 09:44:39,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 09:44:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2024-11-10 09:44:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-10 09:44:39,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:39,613 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:44:39,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 09:44:39,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:44:39,814 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:39,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:39,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1895883018, now seen corresponding path program 1 times [2024-11-10 09:44:39,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:44:39,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212436441] [2024-11-10 09:44:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:39,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:44:39,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:44:39,818 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:44:39,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 09:44:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:43,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 09:44:43,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:44:43,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 09:44:44,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 67