./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.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 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:40:10,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:40:10,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 12:40:10,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:40:10,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:40:10,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:40:10,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:40:10,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:40:10,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:40:10,425 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:40:10,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:40:10,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:40:10,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:40:10,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:40:10,428 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:40:10,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:40:10,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:40:10,428 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:40:10,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 12:40:10,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:40:10,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:40:10,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:40:10,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:40:10,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:40:10,430 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:40:10,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:40:10,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:40:10,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:40:10,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:40:10,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:40:10,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:40:10,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:40:10,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:40:10,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:40:10,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:40:10,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:40:10,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 12:40:10,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 12:40:10,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:40:10,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:40:10,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:40:10,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:40:10,434 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 -> 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 [2024-11-22 12:40:10,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:40:10,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:40:10,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:40:10,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:40:10,631 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:40:10,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2024-11-22 12:40:11,833 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:40:11,987 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:40:11,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2024-11-22 12:40:11,994 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941139523/e544b3b4db2a4f2cb512f26ea7c2ce11/FLAGbdaec9c97 [2024-11-22 12:40:12,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941139523/e544b3b4db2a4f2cb512f26ea7c2ce11 [2024-11-22 12:40:12,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:40:12,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:40:12,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:40:12,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:40:12,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:40:12,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:40:12" (1/1) ... [2024-11-22 12:40:12,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a3ab01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12, skipping insertion in model container [2024-11-22 12:40:12,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:40:12" (1/1) ... [2024-11-22 12:40:12,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:40:12,535 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-a_file-98.i[916,929] [2024-11-22 12:40:12,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:40:12,608 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:40:12,616 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-a_file-98.i[916,929] [2024-11-22 12:40:12,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:40:12,661 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:40:12,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12 WrapperNode [2024-11-22 12:40:12,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:40:12,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:40:12,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:40:12,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:40:12,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12" (1/1) ... [2024-11-22 12:40:12,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12" (1/1) ... [2024-11-22 12:40:12,708 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 518 [2024-11-22 12:40:12,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:40:12,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:40:12,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:40:12,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:40:12,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12" (1/1) ... [2024-11-22 12:40:12,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12" (1/1) ... [2024-11-22 12:40:12,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12" (1/1) ... [2024-11-22 12:40:12,737 INFO L175 MemorySlicer]: Split 134 memory accesses to 5 slices as follows [2, 64, 9, 16, 43]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 8, 1, 1, 5]. The 18 writes are split as follows [0, 8, 1, 1, 8]. [2024-11-22 12:40:12,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12" (1/1) ... [2024-11-22 12:40:12,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12" (1/1) ... [2024-11-22 12:40:12,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12" (1/1) ... [2024-11-22 12:40:12,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12" (1/1) ... [2024-11-22 12:40:12,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12" (1/1) ... [2024-11-22 12:40:12,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12" (1/1) ... [2024-11-22 12:40:12,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:40:12,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:40:12,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:40:12,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:40:12,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12" (1/1) ... [2024-11-22 12:40:12,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:40:12,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:40:12,798 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-22 12:40:12,800 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-22 12:40:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:40:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 12:40:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 12:40:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 12:40:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 12:40:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 12:40:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-22 12:40:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-22 12:40:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-22 12:40:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-22 12:40:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-22 12:40:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-22 12:40:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-22 12:40:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-22 12:40:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-22 12:40:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-22 12:40:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 12:40:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 12:40:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 12:40:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 12:40:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 12:40:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-22 12:40:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-22 12:40:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-22 12:40:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-22 12:40:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-22 12:40:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:40:12,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:40:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 12:40:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 12:40:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 12:40:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 12:40:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 12:40:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:40:12,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:40:12,984 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:40:12,985 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:40:13,353 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-11-22 12:40:13,353 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:40:13,367 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:40:13,367 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:40:13,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:40:13 BoogieIcfgContainer [2024-11-22 12:40:13,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:40:13,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:40:13,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:40:13,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:40:13,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:40:12" (1/3) ... [2024-11-22 12:40:13,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7614ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:40:13, skipping insertion in model container [2024-11-22 12:40:13,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:12" (2/3) ... [2024-11-22 12:40:13,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7614ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:40:13, skipping insertion in model container [2024-11-22 12:40:13,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:40:13" (3/3) ... [2024-11-22 12:40:13,373 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-98.i [2024-11-22 12:40:13,384 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:40:13,384 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:40:13,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:40:13,428 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;@48935612, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:40:13,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:40:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 12:40:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-22 12:40:13,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:40:13,441 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:40:13,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:40:13,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:40:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash -251494613, now seen corresponding path program 1 times [2024-11-22 12:40:13,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:40:13,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138325138] [2024-11-22 12:40:13,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:40:13,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:40:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:40:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-22 12:40:13,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:40:13,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138325138] [2024-11-22 12:40:13,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138325138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:40:13,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602297254] [2024-11-22 12:40:13,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:40:13,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:40:13,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:40:13,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:40:13,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 12:40:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:40:13,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:40:13,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:40:13,987 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-22 12:40:13,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:40:13,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602297254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:40:13,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:40:13,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 12:40:13,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239636395] [2024-11-22 12:40:13,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:40:13,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:40:13,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:40:14,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:40:14,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:40:14,019 INFO L87 Difference]: Start difference. First operand has 123 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 12:40:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:40:14,042 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2024-11-22 12:40:14,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:40:14,044 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-22 12:40:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:40:14,050 INFO L225 Difference]: With dead ends: 239 [2024-11-22 12:40:14,050 INFO L226 Difference]: Without dead ends: 119 [2024-11-22 12:40:14,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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-22 12:40:14,055 INFO L432 NwaCegarLoop]: 174 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, 174 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-22 12:40:14,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:40:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-22 12:40:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-22 12:40:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 12:40:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2024-11-22 12:40:14,087 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 143 [2024-11-22 12:40:14,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:40:14,088 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2024-11-22 12:40:14,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 12:40:14,088 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2024-11-22 12:40:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-22 12:40:14,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:40:14,091 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:40:14,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 12:40:14,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 12:40:14,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:40:14,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:40:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash 13489301, now seen corresponding path program 1 times [2024-11-22 12:40:14,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:40:14,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739682391] [2024-11-22 12:40:14,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:40:14,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:40:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 12:40:14,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129949265] [2024-11-22 12:40:14,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:40:14,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:40:14,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:40:14,506 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:40:14,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 12:40:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:40:14,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 12:40:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:40:15,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 12:40:15,100 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 12:40:15,101 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 12:40:15,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 12:40:15,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-22 12:40:15,311 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-22 12:40:15,381 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 12:40:15,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:40:15 BoogieIcfgContainer [2024-11-22 12:40:15,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 12:40:15,385 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 12:40:15,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 12:40:15,386 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 12:40:15,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:40:13" (3/4) ... [2024-11-22 12:40:15,388 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 12:40:15,389 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 12:40:15,391 INFO L158 Benchmark]: Toolchain (without parser) took 3001.67ms. Allocated memory was 155.2MB in the beginning and 222.3MB in the end (delta: 67.1MB). Free memory was 98.5MB in the beginning and 105.7MB in the end (delta: -7.2MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2024-11-22 12:40:15,391 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:40:15,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.84ms. Allocated memory is still 155.2MB. Free memory was 98.5MB in the beginning and 80.8MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 12:40:15,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.59ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 77.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:40:15,394 INFO L158 Benchmark]: Boogie Preprocessor took 54.36ms. Allocated memory is still 155.2MB. Free memory was 77.1MB in the beginning and 72.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:40:15,394 INFO L158 Benchmark]: RCFGBuilder took 602.33ms. Allocated memory is still 155.2MB. Free memory was 72.1MB in the beginning and 94.2MB in the end (delta: -22.1MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-11-22 12:40:15,394 INFO L158 Benchmark]: TraceAbstraction took 2016.27ms. Allocated memory was 155.2MB in the beginning and 222.3MB in the end (delta: 67.1MB). Free memory was 93.4MB in the beginning and 106.7MB in the end (delta: -13.3MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. [2024-11-22 12:40:15,395 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 222.3MB. Free memory was 106.7MB in the beginning and 105.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:40:15,396 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.14ms. Allocated memory is still 155.2MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.84ms. Allocated memory is still 155.2MB. Free memory was 98.5MB in the beginning and 80.8MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.59ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 77.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.36ms. Allocated memory is still 155.2MB. Free memory was 77.1MB in the beginning and 72.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 602.33ms. Allocated memory is still 155.2MB. Free memory was 72.1MB in the beginning and 94.2MB in the end (delta: -22.1MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2016.27ms. Allocated memory was 155.2MB in the beginning and 222.3MB in the end (delta: 67.1MB). Free memory was 93.4MB in the beginning and 106.7MB in the end (delta: -13.3MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 222.3MB. Free memory was 106.7MB in the beginning and 105.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -1 }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -1 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { 10 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { 10 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L34] unsigned long int last_1_unsigned_long_int_Array_0_4_ = 500; VAL [double_Array_0={4:0}, isInitial=0, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L91] EXPR unsigned_long_int_Array_0[4] [L91] last_1_unsigned_long_int_Array_0_4_ = unsigned_long_int_Array_0[4] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L61] double_Array_0[0][0][0] = __VERIFIER_nondet_double() [L62] EXPR double_Array_0[0][0][0] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F [L62] EXPR double_Array_0[0][0][0] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR (double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR (double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] CALL assume_abort_if_not((double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] RET assume_abort_if_not((double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L63] double_Array_0[1][0][0] = __VERIFIER_nondet_double() [L64] EXPR double_Array_0[1][0][0] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F [L64] EXPR double_Array_0[1][0][0] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR (double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR (double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] CALL assume_abort_if_not((double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] RET assume_abort_if_not((double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L65] double_Array_0[0][1][0] = __VERIFIER_nondet_double() [L66] EXPR double_Array_0[0][1][0] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F [L66] EXPR double_Array_0[0][1][0] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR (double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR (double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] CALL assume_abort_if_not((double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] RET assume_abort_if_not((double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L67] double_Array_0[1][1][0] = __VERIFIER_nondet_double() [L68] EXPR double_Array_0[1][1][0] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F [L68] EXPR double_Array_0[1][1][0] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR (double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR (double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] RET assume_abort_if_not((double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] double_Array_0[1][0][1] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[1][0][1] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F [L70] EXPR double_Array_0[1][0][1] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] RET assume_abort_if_not((double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] double_Array_0[0][1][1] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[0][1][1] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F [L72] EXPR double_Array_0[0][1][1] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR (double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR (double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] RET assume_abort_if_not((double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L74] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L74] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L77] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L78] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L80] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L83] unsigned_long_int_Array_0[2] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[2] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[2] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] EXPR unsigned_long_int_Array_0[2] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] <= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[2] <= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L86] unsigned_long_int_Array_0[3] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[3] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] >= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[3] >= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] EXPR unsigned_long_int_Array_0[3] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L102] RET updateVariables() [L103] CALL step() [L38] EXPR double_Array_0[0][1][1] [L38] EXPR double_Array_0[1][0][1] [L38] double_Array_0[1][1][1] = (double_Array_0[0][1][1] - double_Array_0[1][0][1]) [L39] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L39] COND FALSE !(((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) [L46] EXPR unsigned_long_int_Array_0[2] [L46] unsigned_long_int_Array_0[4] = unsigned_long_int_Array_0[2] [L48] EXPR unsigned_long_int_Array_0[4] [L48] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L48] EXPR unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L48] EXPR signed_long_int_Array_0[0] [L48] unsigned long int stepLocal_0 = (unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0]; [L49] COND FALSE !(8 < stepLocal_0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L52] EXPR double_Array_0[0][1][1] [L52] EXPR double_Array_0[1][0][0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L52] COND FALSE !(double_Array_0[0][1][1] < double_Array_0[1][0][0]) [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR double_Array_0[1][1][1] [L94] EXPR double_Array_0[0][1][1] [L94] EXPR double_Array_0[1][0][1] [L94] EXPR (double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR ((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR ((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94-L95] return (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L19] reach_error() VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 2, TraceHistogramMax: 17, 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, 174 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, 174 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1056/1088 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-22 12:40:15,415 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.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 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:40:17,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:40:17,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 12:40:17,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:40:17,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:40:17,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:40:17,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:40:17,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:40:17,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:40:17,249 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:40:17,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:40:17,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:40:17,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:40:17,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:40:17,252 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:40:17,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:40:17,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:40:17,252 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:40:17,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:40:17,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:40:17,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:40:17,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:40:17,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:40:17,256 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 12:40:17,256 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 12:40:17,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:40:17,256 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 12:40:17,256 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:40:17,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:40:17,257 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:40:17,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:40:17,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:40:17,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:40:17,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:40:17,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:40:17,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:40:17,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:40:17,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:40:17,258 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 12:40:17,258 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 12:40:17,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:40:17,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:40:17,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:40:17,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:40:17,259 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 [2024-11-22 12:40:17,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:40:17,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:40:17,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:40:17,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:40:17,513 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:40:17,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2024-11-22 12:40:18,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:40:18,859 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:40:18,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2024-11-22 12:40:18,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a42d4c62/fe536125888c4f2e976160f9c43bbe1e/FLAGc57e2e8f2 [2024-11-22 12:40:19,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a42d4c62/fe536125888c4f2e976160f9c43bbe1e [2024-11-22 12:40:19,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:40:19,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:40:19,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:40:19,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:40:19,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:40:19,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:40:19" (1/1) ... [2024-11-22 12:40:19,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ccd96a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19, skipping insertion in model container [2024-11-22 12:40:19,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:40:19" (1/1) ... [2024-11-22 12:40:19,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:40:19,429 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-a_file-98.i[916,929] [2024-11-22 12:40:19,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:40:19,510 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:40:19,519 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-a_file-98.i[916,929] [2024-11-22 12:40:19,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:40:19,586 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:40:19,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19 WrapperNode [2024-11-22 12:40:19,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:40:19,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:40:19,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:40:19,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:40:19,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19" (1/1) ... [2024-11-22 12:40:19,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19" (1/1) ... [2024-11-22 12:40:19,648 INFO L138 Inliner]: procedures = 36, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2024-11-22 12:40:19,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:40:19,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:40:19,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:40:19,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:40:19,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19" (1/1) ... [2024-11-22 12:40:19,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19" (1/1) ... [2024-11-22 12:40:19,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19" (1/1) ... [2024-11-22 12:40:19,692 INFO L175 MemorySlicer]: Split 134 memory accesses to 5 slices as follows [2, 64, 9, 16, 43]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 8, 1, 1, 5]. The 18 writes are split as follows [0, 8, 1, 1, 8]. [2024-11-22 12:40:19,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19" (1/1) ... [2024-11-22 12:40:19,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19" (1/1) ... [2024-11-22 12:40:19,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19" (1/1) ... [2024-11-22 12:40:19,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19" (1/1) ... [2024-11-22 12:40:19,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19" (1/1) ... [2024-11-22 12:40:19,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19" (1/1) ... [2024-11-22 12:40:19,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:40:19,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:40:19,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:40:19,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:40:19,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19" (1/1) ... [2024-11-22 12:40:19,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:40:19,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:40:19,783 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-22 12:40:19,786 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-22 12:40:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:40:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-22 12:40:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-22 12:40:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-22 12:40:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-22 12:40:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-22 12:40:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-22 12:40:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-22 12:40:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-22 12:40:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-22 12:40:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-22 12:40:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-22 12:40:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-22 12:40:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-22 12:40:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-22 12:40:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-22 12:40:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 12:40:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 12:40:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 12:40:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 12:40:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-22 12:40:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 12:40:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 12:40:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-22 12:40:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-22 12:40:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-22 12:40:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-22 12:40:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-22 12:40:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-22 12:40:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-22 12:40:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-22 12:40:19,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 12:40:19,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 12:40:19,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 12:40:19,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-22 12:40:19,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-22 12:40:19,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-22 12:40:19,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-22 12:40:19,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-22 12:40:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-22 12:40:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-22 12:40:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:40:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:40:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:40:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:40:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-22 12:40:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-22 12:40:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-22 12:40:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-22 12:40:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-22 12:40:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 12:40:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 12:40:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 12:40:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-22 12:40:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-22 12:40:19,955 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:40:19,957 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:40:26,789 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-22 12:40:26,789 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:40:26,805 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:40:26,806 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:40:26,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:40:26 BoogieIcfgContainer [2024-11-22 12:40:26,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:40:26,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:40:26,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:40:26,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:40:26,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:40:19" (1/3) ... [2024-11-22 12:40:26,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b66136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:40:26, skipping insertion in model container [2024-11-22 12:40:26,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:40:19" (2/3) ... [2024-11-22 12:40:26,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b66136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:40:26, skipping insertion in model container [2024-11-22 12:40:26,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:40:26" (3/3) ... [2024-11-22 12:40:26,814 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-98.i [2024-11-22 12:40:26,829 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:40:26,829 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:40:26,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:40:26,890 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;@4d564dab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:40:26,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:40:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 98 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 12:40:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-22 12:40:26,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:40:26,907 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:40:26,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:40:26,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:40:26,913 INFO L85 PathProgramCache]: Analyzing trace with hash 514802496, now seen corresponding path program 1 times [2024-11-22 12:40:26,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:40:26,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348888709] [2024-11-22 12:40:26,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:40:26,926 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-22 12:40:26,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:40:26,929 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-22 12:40:26,930 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-22 12:40:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:40:27,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:40:27,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:40:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-22 12:40:27,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:40:27,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:40:27,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348888709] [2024-11-22 12:40:27,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348888709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:40:27,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:40:27,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 12:40:27,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614599621] [2024-11-22 12:40:27,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:40:27,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:40:27,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:40:27,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:40:27,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:40:27,459 INFO L87 Difference]: Start difference. First operand has 117 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 98 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 12:40:27,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:40:27,486 INFO L93 Difference]: Finished difference Result 227 states and 357 transitions. [2024-11-22 12:40:27,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:40:27,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2024-11-22 12:40:27,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:40:27,494 INFO L225 Difference]: With dead ends: 227 [2024-11-22 12:40:27,494 INFO L226 Difference]: Without dead ends: 113 [2024-11-22 12:40:27,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-22 12:40:27,503 INFO L432 NwaCegarLoop]: 166 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, 166 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-22 12:40:27,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:40:27,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-22 12:40:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-22 12:40:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 12:40:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions. [2024-11-22 12:40:27,533 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 141 [2024-11-22 12:40:27,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:40:27,534 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 166 transitions. [2024-11-22 12:40:27,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 12:40:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions. [2024-11-22 12:40:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-22 12:40:27,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:40:27,538 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:40:27,553 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-22 12:40:27,739 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-22 12:40:27,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:40:27,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:40:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2101668650, now seen corresponding path program 1 times [2024-11-22 12:40:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:40:27,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540026304] [2024-11-22 12:40:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:40:27,740 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-22 12:40:27,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:40:27,743 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-22 12:40:27,744 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-22 12:40:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:40:28,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:40:28,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:40:28,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:40:28,567 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-22 12:40:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-22 12:40:28,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:40:28,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:40:28,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540026304] [2024-11-22 12:40:28,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540026304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:40:28,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:40:28,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:40:28,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97529578] [2024-11-22 12:40:28,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:40:28,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:40:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:40:28,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:40:28,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:40:28,663 INFO L87 Difference]: Start difference. First operand 113 states and 166 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 12:40:33,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:40:37,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:40:37,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:40:37,163 INFO L93 Difference]: Finished difference Result 224 states and 330 transitions. [2024-11-22 12:40:37,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:40:37,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2024-11-22 12:40:37,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:40:37,165 INFO L225 Difference]: With dead ends: 224 [2024-11-22 12:40:37,165 INFO L226 Difference]: Without dead ends: 114 [2024-11-22 12:40:37,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 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-22 12:40:37,167 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 134 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:40:37,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 482 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2024-11-22 12:40:37,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-22 12:40:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-22 12:40:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 12:40:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2024-11-22 12:40:37,175 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 141 [2024-11-22 12:40:37,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:40:37,178 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2024-11-22 12:40:37,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 12:40:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2024-11-22 12:40:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-22 12:40:37,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:40:37,181 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:40:37,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-22 12:40:37,382 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-22 12:40:37,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:40:37,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:40:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash -570127706, now seen corresponding path program 1 times [2024-11-22 12:40:37,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:40:37,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794820205] [2024-11-22 12:40:37,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:40:37,384 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-22 12:40:37,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:40:37,387 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-22 12:40:37,388 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-22 12:40:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:40:37,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 12:40:37,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:40:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-22 12:40:37,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:40:37,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:40:37,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794820205] [2024-11-22 12:40:37,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794820205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:40:37,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:40:37,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:40:37,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114963914] [2024-11-22 12:40:37,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:40:37,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:40:37,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:40:37,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:40:37,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:40:37,921 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-22 12:40:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:40:38,352 INFO L93 Difference]: Finished difference Result 227 states and 332 transitions. [2024-11-22 12:40:38,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:40:38,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 143 [2024-11-22 12:40:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:40:38,361 INFO L225 Difference]: With dead ends: 227 [2024-11-22 12:40:38,361 INFO L226 Difference]: Without dead ends: 115 [2024-11-22 12:40:38,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:40:38,363 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:40:38,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 682 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 12:40:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-22 12:40:38,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-11-22 12:40:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 12:40:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2024-11-22 12:40:38,375 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 143 [2024-11-22 12:40:38,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:40:38,375 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2024-11-22 12:40:38,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-22 12:40:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2024-11-22 12:40:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-22 12:40:38,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:40:38,377 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:40:38,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 12:40:38,580 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-22 12:40:38,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:40:38,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:40:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1601168604, now seen corresponding path program 1 times [2024-11-22 12:40:38,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:40:38,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097970324] [2024-11-22 12:40:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:40:38,582 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-22 12:40:38,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:40:38,585 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-22 12:40:38,586 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-22 12:40:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:40:38,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:40:38,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:40:39,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:40:39,266 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-22 12:40:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-22 12:40:39,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:40:39,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:40:39,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097970324] [2024-11-22 12:40:39,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097970324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:40:39,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:40:39,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:40:39,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277936452] [2024-11-22 12:40:39,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:40:39,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:40:39,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:40:39,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:40:39,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:40:39,316 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 12:40:44,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:40:47,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:40:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:40:48,090 INFO L93 Difference]: Finished difference Result 224 states and 326 transitions. [2024-11-22 12:40:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:40:48,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-22 12:40:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:40:48,098 INFO L225 Difference]: With dead ends: 224 [2024-11-22 12:40:48,099 INFO L226 Difference]: Without dead ends: 114 [2024-11-22 12:40:48,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:40:48,100 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 123 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-22 12:40:48,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 471 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 1 Unknown, 0 Unchecked, 8.7s Time] [2024-11-22 12:40:48,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-22 12:40:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-22 12:40:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 12:40:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-11-22 12:40:48,111 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 143 [2024-11-22 12:40:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:40:48,112 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-11-22 12:40:48,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 12:40:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-11-22 12:40:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-22 12:40:48,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:40:48,113 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:40:48,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 12:40:48,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:40:48,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:40:48,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:40:48,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1765770602, now seen corresponding path program 1 times [2024-11-22 12:40:48,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:40:48,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365936159] [2024-11-22 12:40:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:40:48,315 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-22 12:40:48,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:40:48,318 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:40:48,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process