./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.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-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f190a6c4b0edbc49af141a983db7689f2287405b384242554734ee34095f2f5c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:29:20,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:29:20,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 12:29:20,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:29:20,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:29:20,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:29:20,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:29:20,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:29:20,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:29:20,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:29:20,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:29:20,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:29:20,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:29:20,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:29:20,677 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:29:20,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:29:20,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:29:20,677 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:29:20,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 12:29:20,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:29:20,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:29:20,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:29:20,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:29:20,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:29:20,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:29:20,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:29:20,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:29:20,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:29:20,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:29:20,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:29:20,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:29:20,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:29:20,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:29:20,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:29:20,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:29:20,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:29:20,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 12:29:20,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 12:29:20,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:29:20,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:29:20,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:29:20,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:29:20,685 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 -> f190a6c4b0edbc49af141a983db7689f2287405b384242554734ee34095f2f5c [2024-11-22 12:29:20,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:29:20,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:29:20,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:29:20,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:29:20,905 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:29:20,906 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-0.i [2024-11-22 12:29:22,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:29:22,363 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:29:22,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i [2024-11-22 12:29:22,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed1539f9/ed4eb06671b1435d8f825be9cc84121f/FLAG07060ad92 [2024-11-22 12:29:22,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed1539f9/ed4eb06671b1435d8f825be9cc84121f [2024-11-22 12:29:22,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:29:22,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:29:22,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:29:22,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:29:22,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:29:22,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:29:22" (1/1) ... [2024-11-22 12:29:22,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53703559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:22, skipping insertion in model container [2024-11-22 12:29:22,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:29:22" (1/1) ... [2024-11-22 12:29:22,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:29:22,560 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-0.i[915,928] [2024-11-22 12:29:22,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:29:22,633 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:29:22,644 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-0.i[915,928] [2024-11-22 12:29:22,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:29:22,713 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:29:22,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:22 WrapperNode [2024-11-22 12:29:22,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:29:22,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:29:22,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:29:22,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:29:22,727 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:29:22" (1/1) ... [2024-11-22 12:29:22,745 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:29:22" (1/1) ... [2024-11-22 12:29:22,808 INFO L138 Inliner]: procedures = 29, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 365 [2024-11-22 12:29:22,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:29:22,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:29:22,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:29:22,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:29:22,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:22" (1/1) ... [2024-11-22 12:29:22,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:22" (1/1) ... [2024-11-22 12:29:22,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:22" (1/1) ... [2024-11-22 12:29:22,836 INFO L175 MemorySlicer]: Split 91 memory accesses to 5 slices as follows [2, 16, 55, 12, 6]. 60 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 4, 2, 1]. The 13 writes are split as follows [0, 2, 8, 2, 1]. [2024-11-22 12:29:22,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:22" (1/1) ... [2024-11-22 12:29:22,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:22" (1/1) ... [2024-11-22 12:29:22,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:22" (1/1) ... [2024-11-22 12:29:22,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:22" (1/1) ... [2024-11-22 12:29:22,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:22" (1/1) ... [2024-11-22 12:29:22,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:22" (1/1) ... [2024-11-22 12:29:22,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:29:22,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:29:22,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:29:22,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:29:22,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:22" (1/1) ... [2024-11-22 12:29:22,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:29:22,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:29:22,900 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:29:22,902 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:29:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:29:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 12:29:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 12:29:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 12:29:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 12:29:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 12:29:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-22 12:29:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-22 12:29:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-22 12:29:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-22 12:29:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-22 12:29:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-22 12:29:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-22 12:29:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-22 12:29:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-22 12:29:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-22 12:29:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 12:29:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 12:29:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 12:29:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 12:29:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 12:29:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-22 12:29:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-22 12:29:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-22 12:29:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-22 12:29:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-22 12:29:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:29:22,936 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:29:22,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 12:29:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 12:29:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 12:29:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 12:29:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 12:29:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:29:22,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:29:23,020 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:29:23,021 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:29:23,371 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-22 12:29:23,371 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:29:23,386 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:29:23,386 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:29:23,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:29:23 BoogieIcfgContainer [2024-11-22 12:29:23,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:29:23,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:29:23,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:29:23,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:29:23,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:29:22" (1/3) ... [2024-11-22 12:29:23,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202371d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:29:23, skipping insertion in model container [2024-11-22 12:29:23,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:22" (2/3) ... [2024-11-22 12:29:23,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202371d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:29:23, skipping insertion in model container [2024-11-22 12:29:23,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:29:23" (3/3) ... [2024-11-22 12:29:23,392 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-0.i [2024-11-22 12:29:23,404 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:29:23,404 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:29:23,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:29:23,452 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;@361b261e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:29:23,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:29:23,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 12:29:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-22 12:29:23,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:29:23,466 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:29:23,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:29:23,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:29:23,471 INFO L85 PathProgramCache]: Analyzing trace with hash -682838324, now seen corresponding path program 1 times [2024-11-22 12:29:23,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:29:23,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032038331] [2024-11-22 12:29:23,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:29:23,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:29:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:29:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-22 12:29:23,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:29:23,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032038331] [2024-11-22 12:29:23,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032038331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:29:23,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419199439] [2024-11-22 12:29:23,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:29:23,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:29:23,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:29:23,705 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:29:23,707 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:29:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:29:23,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:29:23,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:29:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-22 12:29:23,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:29:23,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419199439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:29:23,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:29:23,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 12:29:23,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386905481] [2024-11-22 12:29:23,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:29:23,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:29:23,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:29:23,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:29:23,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:29:23,908 INFO L87 Difference]: Start difference. First operand has 85 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 12:29:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:29:23,928 INFO L93 Difference]: Finished difference Result 160 states and 245 transitions. [2024-11-22 12:29:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:29:23,930 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-22 12:29:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:29:23,936 INFO L225 Difference]: With dead ends: 160 [2024-11-22 12:29:23,936 INFO L226 Difference]: Without dead ends: 78 [2024-11-22 12:29:23,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:29:23,941 INFO L432 NwaCegarLoop]: 108 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, 108 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:29:23,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:29:23,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-22 12:29:23,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-22 12:29:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 12:29:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-11-22 12:29:23,973 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 78 [2024-11-22 12:29:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:29:23,973 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-11-22 12:29:23,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 12:29:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-11-22 12:29:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-22 12:29:23,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:29:23,976 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:29:23,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 12:29:24,180 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:29:24,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:29:24,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:29:24,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1349429352, now seen corresponding path program 1 times [2024-11-22 12:29:24,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:29:24,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327132330] [2024-11-22 12:29:24,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:29:24,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:29:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:29:24,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 12:29:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:29:24,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 12:29:24,448 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 12:29:24,449 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 12:29:24,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 12:29:24,453 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-22 12:29:24,531 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 12:29:24,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:29:24 BoogieIcfgContainer [2024-11-22 12:29:24,535 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 12:29:24,535 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 12:29:24,536 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 12:29:24,536 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 12:29:24,538 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:29:23" (3/4) ... [2024-11-22 12:29:24,541 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 12:29:24,542 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 12:29:24,542 INFO L158 Benchmark]: Toolchain (without parser) took 2156.81ms. Allocated memory is still 178.3MB. Free memory was 106.0MB in the beginning and 136.0MB in the end (delta: -30.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:29:24,543 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:29:24,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.47ms. Allocated memory is still 178.3MB. Free memory was 105.8MB in the beginning and 147.8MB in the end (delta: -42.0MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-11-22 12:29:24,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.10ms. Allocated memory is still 178.3MB. Free memory was 147.0MB in the beginning and 144.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:29:24,544 INFO L158 Benchmark]: Boogie Preprocessor took 53.82ms. Allocated memory is still 178.3MB. Free memory was 144.0MB in the beginning and 139.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:29:24,544 INFO L158 Benchmark]: RCFGBuilder took 523.43ms. Allocated memory is still 178.3MB. Free memory was 139.8MB in the beginning and 112.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-22 12:29:24,544 INFO L158 Benchmark]: TraceAbstraction took 1146.74ms. Allocated memory is still 178.3MB. Free memory was 111.7MB in the beginning and 136.0MB in the end (delta: -24.3MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2024-11-22 12:29:24,545 INFO L158 Benchmark]: Witness Printer took 6.41ms. Allocated memory is still 178.3MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:29:24,546 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.12ms. Allocated memory is still 178.3MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.47ms. Allocated memory is still 178.3MB. Free memory was 105.8MB in the beginning and 147.8MB in the end (delta: -42.0MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.10ms. Allocated memory is still 178.3MB. Free memory was 147.0MB in the beginning and 144.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.82ms. Allocated memory is still 178.3MB. Free memory was 144.0MB in the beginning and 139.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 523.43ms. Allocated memory is still 178.3MB. Free memory was 139.8MB in the beginning and 112.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1146.74ms. Allocated memory is still 178.3MB. Free memory was 111.7MB in the beginning and 136.0MB in the end (delta: -24.3MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. * Witness Printer took 6.41ms. Allocated memory is still 178.3MB. Free memory is still 136.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 92, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L28-L30] unsigned char unsigned_char_Array_0[2] = { 1, 100 }; [L28-L30] unsigned char unsigned_char_Array_0[2] = { 1, 100 }; [L28-L30] unsigned char unsigned_char_Array_0[2] = { 1, 100 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[1] = { 5 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[1] = { 5 }; [L34] double last_1_double_Array_0_0__0_ = 5.25; [L35] unsigned char last_1_unsigned_char_Array_0_1_ = 100; [L36] unsigned short int last_1_unsigned_short_int_Array_0_0_ = 5; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] CALL updateLastVariables() [L87] EXPR double_Array_0[0][0] [L87] last_1_double_Array_0_0__0_ = double_Array_0[0][0] [L88] EXPR unsigned_char_Array_0[1] [L88] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L89] EXPR unsigned_short_int_Array_0[0] [L89] last_1_unsigned_short_int_Array_0_0_ = unsigned_short_int_Array_0[0] [L99] RET updateLastVariables() [L100] CALL updateVariables() [L72] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] double_Array_0[1][0] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[1][0] [L79] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L79] EXPR double_Array_0[1][0] [L79] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] double_Array_0[0][1] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[0][1] [L81] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F [L81] EXPR double_Array_0[0][1] [L81] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L83] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] RET updateVariables() [L101] CALL step() [L40] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L40] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L45] COND FALSE !((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L50] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L50] COND TRUE ! BOOL_unsigned_char_Array_0[1] [L51] EXPR double_Array_0[0][1] [L51] EXPR double_Array_0[1][0] [L51] double_Array_0[1][1] = (double_Array_0[0][1] - double_Array_0[1][0]) [L55] EXPR double_Array_0[0][1] [L55] EXPR double_Array_0[1][0] [L55] EXPR double_Array_0[1][1] [L55] EXPR double_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L55] COND FALSE !((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) [L68] EXPR double_Array_0[0][1] [L68] double_Array_0[0][0] = double_Array_0[0][1] [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR (! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1]))))) [L92] EXPR double_Array_0[1][1] [L92] EXPR double_Array_0[0][1] [L92] EXPR double_Array_0[1][0] [L92] EXPR (! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR (((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR (((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR ((((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (((double_Array_0[1][0] * (double_Array_0[0][1] - 5.3)) <= last_1_double_Array_0_0__0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_1_)) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR ((((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (((double_Array_0[1][0] * (double_Array_0[0][1] - 5.3)) <= last_1_double_Array_0_0__0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_1_)) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92-L93] return ((((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (((double_Array_0[1][0] * (double_Array_0[0][1] - 5.3)) <= last_1_double_Array_0_0__0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_1_)) : 1) : 1) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 108 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, 108 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred 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.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 292 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 210/224 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:29:24,582 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-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f190a6c4b0edbc49af141a983db7689f2287405b384242554734ee34095f2f5c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:29:26,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:29:26,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 12:29:26,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:29:26,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:29:26,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:29:26,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:29:26,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:29:26,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:29:26,805 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:29:26,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:29:26,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:29:26,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:29:26,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:29:26,807 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:29:26,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:29:26,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:29:26,807 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:29:26,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:29:26,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:29:26,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:29:26,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:29:26,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:29:26,809 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 12:29:26,809 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 12:29:26,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:29:26,810 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 12:29:26,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:29:26,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:29:26,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:29:26,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:29:26,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:29:26,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:29:26,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:29:26,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:29:26,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:29:26,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:29:26,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:29:26,813 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 12:29:26,813 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 12:29:26,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:29:26,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:29:26,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:29:26,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:29:26,817 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 -> f190a6c4b0edbc49af141a983db7689f2287405b384242554734ee34095f2f5c [2024-11-22 12:29:27,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:29:27,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:29:27,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:29:27,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:29:27,110 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:29:27,111 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-0.i [2024-11-22 12:29:28,542 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:29:28,733 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:29:28,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i [2024-11-22 12:29:28,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe1ac846/7ab4eebad4ff4169a3b4d2e07d2de5ab/FLAG62c64194c [2024-11-22 12:29:28,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe1ac846/7ab4eebad4ff4169a3b4d2e07d2de5ab [2024-11-22 12:29:28,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:29:28,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:29:28,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:29:28,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:29:28,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:29:28,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:29:28" (1/1) ... [2024-11-22 12:29:28,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3142b20b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:28, skipping insertion in model container [2024-11-22 12:29:28,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:29:28" (1/1) ... [2024-11-22 12:29:28,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:29:28,889 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-0.i[915,928] [2024-11-22 12:29:28,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:29:28,967 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:29:28,980 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-0.i[915,928] [2024-11-22 12:29:29,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:29:29,038 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:29:29,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:29 WrapperNode [2024-11-22 12:29:29,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:29:29,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:29:29,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:29:29,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:29:29,046 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:29:29" (1/1) ... [2024-11-22 12:29:29,065 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:29:29" (1/1) ... [2024-11-22 12:29:29,101 INFO L138 Inliner]: procedures = 33, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 365 [2024-11-22 12:29:29,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:29:29,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:29:29,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:29:29,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:29:29,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:29" (1/1) ... [2024-11-22 12:29:29,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:29" (1/1) ... [2024-11-22 12:29:29,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:29" (1/1) ... [2024-11-22 12:29:29,142 INFO L175 MemorySlicer]: Split 91 memory accesses to 5 slices as follows [2, 16, 55, 12, 6]. 60 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 4, 2, 1]. The 13 writes are split as follows [0, 2, 8, 2, 1]. [2024-11-22 12:29:29,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:29" (1/1) ... [2024-11-22 12:29:29,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:29" (1/1) ... [2024-11-22 12:29:29,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:29" (1/1) ... [2024-11-22 12:29:29,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:29" (1/1) ... [2024-11-22 12:29:29,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:29" (1/1) ... [2024-11-22 12:29:29,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:29" (1/1) ... [2024-11-22 12:29:29,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:29:29,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:29:29,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:29:29,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:29:29,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:29" (1/1) ... [2024-11-22 12:29:29,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:29:29,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:29:29,219 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:29:29,222 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:29:29,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:29:29,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-22 12:29:29,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-22 12:29:29,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-22 12:29:29,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-22 12:29:29,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-22 12:29:29,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-22 12:29:29,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-22 12:29:29,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-22 12:29:29,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-22 12:29:29,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-22 12:29:29,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 12:29:29,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 12:29:29,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 12:29:29,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-22 12:29:29,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-22 12:29:29,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-22 12:29:29,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-22 12:29:29,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-22 12:29:29,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-22 12:29:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-22 12:29:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 12:29:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 12:29:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 12:29:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 12:29:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-22 12:29:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-22 12:29:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-22 12:29:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-22 12:29:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-22 12:29:29,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-22 12:29:29,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-22 12:29:29,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-22 12:29:29,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-22 12:29:29,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-22 12:29:29,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-22 12:29:29,268 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:29:29,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:29:29,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:29:29,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:29:29,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 12:29:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 12:29:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-22 12:29:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-22 12:29:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-22 12:29:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-22 12:29:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-22 12:29:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-22 12:29:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-22 12:29:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-22 12:29:29,367 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:29:29,369 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:29:49,842 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-11-22 12:29:49,842 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:29:49,852 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:29:49,853 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:29:49,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:29:49 BoogieIcfgContainer [2024-11-22 12:29:49,853 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:29:49,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:29:49,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:29:49,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:29:49,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:29:28" (1/3) ... [2024-11-22 12:29:49,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d66042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:29:49, skipping insertion in model container [2024-11-22 12:29:49,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:29:29" (2/3) ... [2024-11-22 12:29:49,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d66042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:29:49, skipping insertion in model container [2024-11-22 12:29:49,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:29:49" (3/3) ... [2024-11-22 12:29:49,859 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-0.i [2024-11-22 12:29:49,871 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:29:49,871 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:29:49,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:29:49,918 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;@21a4059e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:29:49,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:29:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 12:29:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-22 12:29:49,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:29:49,931 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:29:49,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:29:49,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:29:49,935 INFO L85 PathProgramCache]: Analyzing trace with hash -682838324, now seen corresponding path program 1 times [2024-11-22 12:29:49,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:29:49,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543718542] [2024-11-22 12:29:49,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:29:49,947 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:29:49,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:29:49,950 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:29:49,966 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:29:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:29:50,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:29:50,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:29:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-22 12:29:50,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:29:50,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:29:50,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543718542] [2024-11-22 12:29:50,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543718542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:29:50,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:29:50,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 12:29:50,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006694982] [2024-11-22 12:29:50,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:29:50,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:29:50,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:29:50,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:29:50,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:29:50,487 INFO L87 Difference]: Start difference. First operand has 85 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 12:29:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:29:50,506 INFO L93 Difference]: Finished difference Result 160 states and 245 transitions. [2024-11-22 12:29:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:29:50,508 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-22 12:29:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:29:50,513 INFO L225 Difference]: With dead ends: 160 [2024-11-22 12:29:50,513 INFO L226 Difference]: Without dead ends: 78 [2024-11-22 12:29:50,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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:29:50,518 INFO L432 NwaCegarLoop]: 108 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, 108 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:29:50,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:29:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-22 12:29:50,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-22 12:29:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 12:29:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-11-22 12:29:50,546 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 78 [2024-11-22 12:29:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:29:50,547 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-11-22 12:29:50,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 12:29:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-11-22 12:29:50,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-22 12:29:50,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:29:50,549 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:29:50,566 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:29:50,750 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:29:50,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:29:50,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:29:50,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1349429352, now seen corresponding path program 1 times [2024-11-22 12:29:50,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:29:50,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703660197] [2024-11-22 12:29:50,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:29:50,755 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:29:50,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:29:50,757 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:29:50,758 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:29:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:29:51,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:29:51,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:29:51,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:29:51,590 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:29:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-22 12:29:51,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:29:51,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:29:51,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703660197] [2024-11-22 12:29:51,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703660197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:29:51,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:29:51,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:29:51,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102372495] [2024-11-22 12:29:51,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:29:51,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:29:51,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:29:51,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:29:51,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:29:51,689 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 12:29:56,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s 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:30:00,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:30:04,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:30:08,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:30:12,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-22 12:30:14,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:30:21,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s 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:30:25,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:30:30,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-22 12:30:32,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s 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:30:35,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-22 12:30:35,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:30:35,936 INFO L93 Difference]: Finished difference Result 154 states and 214 transitions. [2024-11-22 12:30:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:30:35,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-22 12:30:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:30:35,968 INFO L225 Difference]: With dead ends: 154 [2024-11-22 12:30:35,968 INFO L226 Difference]: Without dead ends: 79 [2024-11-22 12:30:35,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:30:35,970 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 88 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:30:35,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 296 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 8 Unknown, 0 Unchecked, 44.1s Time] [2024-11-22 12:30:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-22 12:30:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-11-22 12:30:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.338235294117647) internal successors, (91), 68 states have internal predecessors, (91), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 12:30:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2024-11-22 12:30:35,979 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 78 [2024-11-22 12:30:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:30:35,980 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2024-11-22 12:30:35,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 12:30:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2024-11-22 12:30:35,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-22 12:30:35,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:30:35,984 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:30:36,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 12:30:36,184 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:30:36,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:30:36,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:30:36,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1194709860, now seen corresponding path program 1 times [2024-11-22 12:30:36,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:30:36,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347232417] [2024-11-22 12:30:36,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:30:36,186 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:30:36,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:30:36,188 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:30:36,189 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:30:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:30:36,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 12:30:36,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:30:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-22 12:30:36,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:30:36,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:30:36,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347232417] [2024-11-22 12:30:36,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347232417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:30:36,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:30:36,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:30:36,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831180497] [2024-11-22 12:30:36,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:30:36,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:30:36,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:30:36,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:30:36,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:30:36,842 INFO L87 Difference]: Start difference. First operand 78 states and 107 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-22 12:30:37,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:30:37,163 INFO L93 Difference]: Finished difference Result 157 states and 216 transitions. [2024-11-22 12:30:37,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:30:37,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2024-11-22 12:30:37,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:30:37,165 INFO L225 Difference]: With dead ends: 157 [2024-11-22 12:30:37,165 INFO L226 Difference]: Without dead ends: 80 [2024-11-22 12:30:37,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 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:30:37,166 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:30:37,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 452 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:30:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-22 12:30:37,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-11-22 12:30:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 68 states have internal predecessors, (90), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 12:30:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2024-11-22 12:30:37,173 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 106 transitions. Word has length 80 [2024-11-22 12:30:37,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:30:37,173 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 106 transitions. [2024-11-22 12:30:37,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-22 12:30:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2024-11-22 12:30:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-22 12:30:37,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:30:37,174 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:30:37,189 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:30:37,378 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:30:37,379 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:30:37,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:30:37,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1161095390, now seen corresponding path program 1 times [2024-11-22 12:30:37,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:30:37,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7619313] [2024-11-22 12:30:37,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:30:37,380 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:30:37,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:30:37,383 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:30:37,384 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:30:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:30:37,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:30:37,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:30:38,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:30:38,124 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:30:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-22 12:30:38,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:30:38,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:30:38,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7619313] [2024-11-22 12:30:38,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7619313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:30:38,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:30:38,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:30:38,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566742958] [2024-11-22 12:30:38,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:30:38,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:30:38,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:30:38,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:30:38,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:30:38,185 INFO L87 Difference]: Start difference. First operand 78 states and 106 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 12:30:42,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s 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:30:46,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s 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:30:50,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-22 12:30:52,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-22 12:30:55,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:30:58,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:30:59,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:31:03,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s 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:31:07,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []