./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.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 803046ced68b079bb7f08c78720a8843883361424ea99724f710829affe474a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:12:42,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:12:42,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:12:42,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:12:42,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:12:42,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:12:42,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:12:42,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:12:42,721 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:12:42,722 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:12:42,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:12:42,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:12:42,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:12:42,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:12:42,725 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:12:42,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:12:42,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:12:42,726 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:12:42,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:12:42,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:12:42,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:12:42,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:12:42,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:12:42,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:12:42,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:12:42,732 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:12:42,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:12:42,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:12:42,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:12:42,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:12:42,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:12:42,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:12:42,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:12:42,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:12:42,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:12:42,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:12:42,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:12:42,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:12:42,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:12:42,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:12:42,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:12:42,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:12:42,738 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 -> 803046ced68b079bb7f08c78720a8843883361424ea99724f710829affe474a7 [2024-11-12 07:12:42,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:12:43,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:12:43,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:12:43,030 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:12:43,030 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:12:43,032 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-7.i [2024-11-12 07:12:44,576 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:12:44,784 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:12:44,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.i [2024-11-12 07:12:44,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c429e2e/fdfe08bf62cc45339993b223db14229f/FLAGe2556155a [2024-11-12 07:12:45,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c429e2e/fdfe08bf62cc45339993b223db14229f [2024-11-12 07:12:45,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:12:45,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:12:45,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:12:45,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:12:45,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:12:45,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:12:45" (1/1) ... [2024-11-12 07:12:45,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24fd63c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45, skipping insertion in model container [2024-11-12 07:12:45,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:12:45" (1/1) ... [2024-11-12 07:12:45,193 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:12:45,403 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-7.i[915,928] [2024-11-12 07:12:45,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:12:45,521 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:12:45,534 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-7.i[915,928] [2024-11-12 07:12:45,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:12:45,596 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:12:45,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45 WrapperNode [2024-11-12 07:12:45,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:12:45,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:12:45,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:12:45,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:12:45,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45" (1/1) ... [2024-11-12 07:12:45,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45" (1/1) ... [2024-11-12 07:12:45,677 INFO L138 Inliner]: procedures = 29, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 484 [2024-11-12 07:12:45,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:12:45,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:12:45,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:12:45,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:12:45,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45" (1/1) ... [2024-11-12 07:12:45,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45" (1/1) ... [2024-11-12 07:12:45,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45" (1/1) ... [2024-11-12 07:12:45,731 INFO L175 MemorySlicer]: Split 122 memory accesses to 7 slices as follows [2, 18, 28, 22, 33, 8, 11]. 27 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 2, 2, 1, 1]. The 16 writes are split as follows [0, 2, 4, 2, 4, 3, 1]. [2024-11-12 07:12:45,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45" (1/1) ... [2024-11-12 07:12:45,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45" (1/1) ... [2024-11-12 07:12:45,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45" (1/1) ... [2024-11-12 07:12:45,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45" (1/1) ... [2024-11-12 07:12:45,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45" (1/1) ... [2024-11-12 07:12:45,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45" (1/1) ... [2024-11-12 07:12:45,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:12:45,769 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:12:45,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:12:45,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:12:45,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45" (1/1) ... [2024-11-12 07:12:45,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:12:45,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:12:45,811 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-12 07:12:45,814 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-12 07:12:45,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:12:45,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:12:45,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:12:45,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 07:12:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 07:12:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 07:12:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 07:12:45,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-12 07:12:45,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-12 07:12:45,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-12 07:12:45,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-12 07:12:45,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-12 07:12:45,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-12 07:12:45,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-12 07:12:45,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-12 07:12:45,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-12 07:12:45,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-12 07:12:45,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-12 07:12:45,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-12 07:12:45,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-12 07:12:45,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-12 07:12:45,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-12 07:12:45,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:12:45,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:12:45,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 07:12:45,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 07:12:45,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 07:12:45,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 07:12:45,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-12 07:12:45,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-12 07:12:45,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-12 07:12:45,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-12 07:12:45,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-12 07:12:45,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-12 07:12:45,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-12 07:12:45,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-12 07:12:45,879 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:12:45,879 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:12:45,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:12:45,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:12:45,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 07:12:45,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 07:12:45,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 07:12:45,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 07:12:45,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-12 07:12:45,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:12:45,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:12:46,056 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:12:46,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:12:46,557 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-11-12 07:12:46,557 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:12:46,570 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:12:46,571 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:12:46,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:12:46 BoogieIcfgContainer [2024-11-12 07:12:46,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:12:46,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:12:46,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:12:46,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:12:46,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:12:45" (1/3) ... [2024-11-12 07:12:46,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6572ddc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:12:46, skipping insertion in model container [2024-11-12 07:12:46,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:45" (2/3) ... [2024-11-12 07:12:46,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6572ddc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:12:46, skipping insertion in model container [2024-11-12 07:12:46,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:12:46" (3/3) ... [2024-11-12 07:12:46,581 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-7.i [2024-11-12 07:12:46,597 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:12:46,597 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:12:46,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:12:46,666 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;@6931298b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:12:46,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:12:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 86 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:12:46,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:12:46,687 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:12:46,688 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:12:46,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:12:46,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:12:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash -147929321, now seen corresponding path program 1 times [2024-11-12 07:12:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:12:46,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275732657] [2024-11-12 07:12:46,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:12:46,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:12:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:12:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:12:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:12:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:12:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:12:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:12:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:12:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:12:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:12:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:12:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:12:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:12:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:12:47,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:12:47,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275732657] [2024-11-12 07:12:47,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275732657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:12:47,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:12:47,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:12:47,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620725538] [2024-11-12 07:12:47,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:12:47,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:12:47,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:12:47,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:12:47,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:12:47,113 INFO L87 Difference]: Start difference. First operand has 100 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 86 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:12:47,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:12:47,153 INFO L93 Difference]: Finished difference Result 193 states and 304 transitions. [2024-11-12 07:12:47,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:12:47,155 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-12 07:12:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:12:47,163 INFO L225 Difference]: With dead ends: 193 [2024-11-12 07:12:47,163 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 07:12:47,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-12 07:12:47,172 INFO L435 NwaCegarLoop]: 138 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, 138 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-12 07:12:47,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:12:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 07:12:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-12 07:12:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:12:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-12 07:12:47,264 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 103 [2024-11-12 07:12:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:12:47,265 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-12 07:12:47,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:12:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-12 07:12:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:12:47,287 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:12:47,287 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:12:47,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:12:47,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:12:47,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:12:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1365420453, now seen corresponding path program 1 times [2024-11-12 07:12:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:12:47,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060221584] [2024-11-12 07:12:47,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:12:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:12:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:12:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:12:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:12:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:12:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:12:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:12:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:12:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:12:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:12:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:12:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:12:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:12:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:12:47,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:12:47,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060221584] [2024-11-12 07:12:47,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060221584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:12:47,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:12:47,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:12:47,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796711332] [2024-11-12 07:12:47,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:12:47,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:12:47,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:12:47,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:12:47,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:12:47,630 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:12:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:12:47,665 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2024-11-12 07:12:47,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:12:47,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-12 07:12:47,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:12:47,668 INFO L225 Difference]: With dead ends: 191 [2024-11-12 07:12:47,668 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 07:12:47,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:12:47,670 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:12:47,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:12:47,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 07:12:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-12 07:12:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:12:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-12 07:12:47,688 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 103 [2024-11-12 07:12:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:12:47,689 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-12 07:12:47,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:12:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-12 07:12:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:12:47,694 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:12:47,694 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:12:47,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:12:47,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:12:47,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:12:47,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1406095203, now seen corresponding path program 1 times [2024-11-12 07:12:47,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:12:47,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256827844] [2024-11-12 07:12:47,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:12:47,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:12:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:12:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:12:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:12:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:12:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:12:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:12:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:12:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:12:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:12:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:12:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:12:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:12:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:12:47,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:12:47,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256827844] [2024-11-12 07:12:47,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256827844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:12:47,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:12:47,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:12:47,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138515040] [2024-11-12 07:12:47,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:12:47,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:12:47,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:12:47,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:12:47,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:12:47,873 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:12:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:12:47,908 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-11-12 07:12:47,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:12:47,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-12 07:12:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:12:47,910 INFO L225 Difference]: With dead ends: 194 [2024-11-12 07:12:47,911 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 07:12:47,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:12:47,912 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:12:47,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:12:47,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 07:12:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-12 07:12:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:12:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-12 07:12:47,930 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 103 [2024-11-12 07:12:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:12:47,932 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-12 07:12:47,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:12:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-12 07:12:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:12:47,937 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:12:47,937 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:12:47,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:12:47,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:12:47,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:12:47,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1877754843, now seen corresponding path program 1 times [2024-11-12 07:12:47,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:12:47,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398546381] [2024-11-12 07:12:47,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:12:47,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:12:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:49,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:12:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:49,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:12:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:49,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:12:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:49,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:12:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:12:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:12:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:12:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:12:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:49,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:12:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:12:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:49,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:12:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:49,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:12:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:12:49,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:12:49,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398546381] [2024-11-12 07:12:49,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398546381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:12:49,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:12:49,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:12:49,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225553878] [2024-11-12 07:12:49,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:12:49,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:12:49,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:12:49,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:12:49,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:12:49,113 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:12:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:12:49,362 INFO L93 Difference]: Finished difference Result 234 states and 334 transitions. [2024-11-12 07:12:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:12:49,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-12 07:12:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:12:49,366 INFO L225 Difference]: With dead ends: 234 [2024-11-12 07:12:49,366 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 07:12:49,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:12:49,367 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 111 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:12:49,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 722 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:12:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 07:12:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2024-11-12 07:12:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.3565217391304347) internal successors, (156), 116 states have internal predecessors, (156), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 07:12:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2024-11-12 07:12:49,394 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 194 transitions. Word has length 103 [2024-11-12 07:12:49,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:12:49,394 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 194 transitions. [2024-11-12 07:12:49,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:12:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 194 transitions. [2024-11-12 07:12:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 07:12:49,396 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:12:49,396 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:12:49,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:12:49,397 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:12:49,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:12:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1232570068, now seen corresponding path program 1 times [2024-11-12 07:12:49,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:12:49,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700535310] [2024-11-12 07:12:49,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:12:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:12:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:12:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:50,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:12:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:50,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:12:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:50,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:12:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:50,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:12:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:50,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:12:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:50,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:12:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:50,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:12:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:50,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:12:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:50,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:12:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:50,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:12:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:50,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:12:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:12:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:12:50,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:12:50,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700535310] [2024-11-12 07:12:50,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700535310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:12:50,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:12:50,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:12:50,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862441920] [2024-11-12 07:12:50,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:12:50,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:12:50,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:12:50,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:12:50,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:12:50,283 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:12:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:12:50,472 INFO L93 Difference]: Finished difference Result 240 states and 338 transitions. [2024-11-12 07:12:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:12:50,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-12 07:12:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:12:50,476 INFO L225 Difference]: With dead ends: 240 [2024-11-12 07:12:50,477 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 07:12:50,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:12:50,481 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 107 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:12:50,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 884 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:12:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 07:12:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2024-11-12 07:12:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 114 states have internal predecessors, (153), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 07:12:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 191 transitions. [2024-11-12 07:12:50,503 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 191 transitions. Word has length 105 [2024-11-12 07:12:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:12:50,503 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 191 transitions. [2024-11-12 07:12:50,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:12:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 191 transitions. [2024-11-12 07:12:50,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-12 07:12:50,505 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:12:50,505 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:12:50,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:12:50,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:12:50,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:12:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash 914371895, now seen corresponding path program 1 times [2024-11-12 07:12:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:12:50,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642117020] [2024-11-12 07:12:50,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:12:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:12:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:12:50,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802007953] [2024-11-12 07:12:50,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:12:50,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:12:50,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:12:50,616 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-12 07:12:50,618 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-12 07:12:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:12:51,184 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:12:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:12:51,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:12:51,440 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:12:51,441 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:12:51,455 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-12 07:12:51,643 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,SelfDestructingSolverStorable5 [2024-11-12 07:12:51,647 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 07:12:51,746 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:12:51,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:12:51 BoogieIcfgContainer [2024-11-12 07:12:51,752 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:12:51,752 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:12:51,752 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:12:51,752 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:12:51,753 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:12:46" (3/4) ... [2024-11-12 07:12:51,756 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:12:51,757 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:12:51,757 INFO L158 Benchmark]: Toolchain (without parser) took 6609.98ms. Allocated memory was 144.7MB in the beginning and 234.9MB in the end (delta: 90.2MB). Free memory was 72.5MB in the beginning and 64.1MB in the end (delta: 8.5MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2024-11-12 07:12:51,758 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 144.7MB. Free memory was 95.1MB in the beginning and 94.9MB in the end (delta: 170.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 07:12:51,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.30ms. Allocated memory was 144.7MB in the beginning and 195.0MB in the end (delta: 50.3MB). Free memory was 72.4MB in the beginning and 163.8MB in the end (delta: -91.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-11-12 07:12:51,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.45ms. Allocated memory is still 195.0MB. Free memory was 163.8MB in the beginning and 159.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:12:51,759 INFO L158 Benchmark]: Boogie Preprocessor took 89.22ms. Allocated memory is still 195.0MB. Free memory was 159.6MB in the beginning and 154.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:12:51,759 INFO L158 Benchmark]: RCFGBuilder took 802.97ms. Allocated memory is still 195.0MB. Free memory was 154.3MB in the beginning and 118.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-12 07:12:51,760 INFO L158 Benchmark]: TraceAbstraction took 5178.29ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 117.6MB in the beginning and 64.1MB in the end (delta: 53.6MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. [2024-11-12 07:12:51,772 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 234.9MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:12:51,775 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.24ms. Allocated memory is still 144.7MB. Free memory was 95.1MB in the beginning and 94.9MB in the end (delta: 170.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.30ms. Allocated memory was 144.7MB in the beginning and 195.0MB in the end (delta: 50.3MB). Free memory was 72.4MB in the beginning and 163.8MB in the end (delta: -91.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.45ms. Allocated memory is still 195.0MB. Free memory was 163.8MB in the beginning and 159.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.22ms. Allocated memory is still 195.0MB. Free memory was 159.6MB in the beginning and 154.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 802.97ms. Allocated memory is still 195.0MB. Free memory was 154.3MB in the beginning and 118.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5178.29ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 117.6MB in the beginning and 64.1MB in the end (delta: 53.6MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 234.9MB. Free memory is still 64.1MB. 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 101, overapproximation of someBinaryFLOATComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 1 }; [L25-L27] double double_Array_0[2] = { 0.2, 127.5 }; [L25-L27] double double_Array_0[2] = { 0.2, 127.5 }; [L25-L27] double double_Array_0[2] = { 0.2, 127.5 }; [L28-L30] float float_Array_0[2] = { 100000000000.4, 8.2 }; [L28-L30] float float_Array_0[2] = { 100000000000.4, 8.2 }; [L28-L30] float float_Array_0[2] = { 100000000000.4, 8.2 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 1 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 1 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 5 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 5 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L40] double last_1_double_Array_0_0_ = 0.2; [L41] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 5; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] EXPR double_Array_0[0] [L97] last_1_double_Array_0_0_ = double_Array_0[0] [L98] EXPR unsigned_long_int_Array_0[0] [L98] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L76] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] 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}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] 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}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] 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}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] 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}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] 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}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] 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}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] 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}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] 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}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] double_Array_0[1] = __VERIFIER_nondet_double() [L83] EXPR double_Array_0[1] [L83] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L83] EXPR double_Array_0[1] [L83] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] float_Array_0[0] = __VERIFIER_nondet_float() [L85] EXPR float_Array_0[0] [L85] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F [L85] EXPR float_Array_0[0] [L85] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] float_Array_0[1] = __VERIFIER_nondet_float() [L87] EXPR float_Array_0[1] [L87] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L87] EXPR float_Array_0[1] [L87] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] 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}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] 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}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L109] RET updateVariables() [L110] CALL step() [L45] EXPR float_Array_0[1] [L45] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) [L52] EXPR unsigned_char_Array_0[0] [L52] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L54] EXPR BOOL_unsigned_char_Array_0[0] [L54] BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L54] BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1]) [L54] EXPR unsigned_char_Array_0[0] [L54] EXPR unsigned_short_int_Array_0[0] [L54] EXPR unsigned_char_Array_0[1] [L54] BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) [L61] EXPR double_Array_0[1] [L61] double_Array_0[0] = double_Array_0[1] [L63] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L63] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L72] EXPR unsigned_char_Array_0[0] [L72] unsigned_long_int_Array_0[0] = unsigned_char_Array_0[0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR float_Array_0[1] [L101] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L101] EXPR unsigned_char_Array_0[1] [L101] EXPR unsigned_char_Array_0[0] [L101] EXPR (! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) [L101] EXPR BOOL_unsigned_char_Array_0[0] [L101] EXPR BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1]) [L101] EXPR unsigned_char_Array_0[0] [L101] EXPR unsigned_short_int_Array_0[0] [L101] EXPR unsigned_char_Array_0[1] [L101] EXPR BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) [L101] EXPR double_Array_0[0] [L101] EXPR double_Array_0[1] [L101] EXPR (BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])))) && (BOOL_unsigned_char_Array_0[0] ? ((BOOL_unsigned_char_Array_0[1] && (float_Array_0[0] <= double_Array_0[0])) ? ((((((float_Array_0[0]) > (double_Array_0[1])) ? (float_Array_0[0]) : (double_Array_0[1]))) > double_Array_0[0]) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((((3725801564u - unsigned_char_Array_0[0]) - unsigned_char_Array_0[1])) > (unsigned_short_int_Array_0[0])) ? (((3725801564u - unsigned_char_Array_0[0]) - unsigned_char_Array_0[1])) : (unsigned_short_int_Array_0[0]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0]))) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])))) && (BOOL_unsigned_char_Array_0[0] ? ((BOOL_unsigned_char_Array_0[1] && (float_Array_0[0] <= double_Array_0[0])) ? ((((((float_Array_0[0]) > (double_Array_0[1])) ? (float_Array_0[0]) : (double_Array_0[1]))) > double_Array_0[0]) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((((3725801564u - unsigned_char_Array_0[0]) - unsigned_char_Array_0[1])) > (unsigned_short_int_Array_0[0])) ? (((3725801564u - unsigned_char_Array_0[0]) - unsigned_char_Array_0[1])) : (unsigned_short_int_Array_0[0]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0]))) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101-L102] return (((! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])))) && (BOOL_unsigned_char_Array_0[0] ? ((BOOL_unsigned_char_Array_0[1] && (float_Array_0[0] <= double_Array_0[0])) ? ((((((float_Array_0[0]) > (double_Array_0[1])) ? (float_Array_0[0]) : (double_Array_0[1]))) > double_Array_0[0]) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((((3725801564u - unsigned_char_Array_0[0]) - unsigned_char_Array_0[1])) > (unsigned_short_int_Array_0[0])) ? (((3725801564u - unsigned_char_Array_0[0]) - unsigned_char_Array_0[1])) : (unsigned_short_int_Array_0[0]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0]))) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0]))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 218 mSDsluCounter, 2409 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1654 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 237 IncrementalHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 755 mSDtfsCounter, 237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=4, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 729 NumberOfCodeBlocks, 729 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1320/1320 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-12 07:12:51,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.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 803046ced68b079bb7f08c78720a8843883361424ea99724f710829affe474a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:12:54,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:12:54,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:12:54,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:12:54,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:12:54,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:12:54,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:12:54,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:12:54,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:12:54,147 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:12:54,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:12:54,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:12:54,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:12:54,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:12:54,152 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:12:54,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:12:54,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:12:54,153 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:12:54,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:12:54,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:12:54,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:12:54,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:12:54,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:12:54,158 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:12:54,158 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:12:54,158 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:12:54,159 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:12:54,159 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:12:54,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:12:54,160 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:12:54,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:12:54,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:12:54,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:12:54,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:12:54,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:12:54,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:12:54,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:12:54,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:12:54,164 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:12:54,164 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:12:54,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:12:54,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:12:54,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:12:54,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:12:54,165 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 -> 803046ced68b079bb7f08c78720a8843883361424ea99724f710829affe474a7 [2024-11-12 07:12:54,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:12:54,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:12:54,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:12:54,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:12:54,551 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:12:54,552 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-7.i [2024-11-12 07:12:56,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:12:56,347 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:12:56,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.i [2024-11-12 07:12:56,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/150a92d2a/2c7574aab5a0441baa36043a6ec4509d/FLAGf4d4e1472 [2024-11-12 07:12:56,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/150a92d2a/2c7574aab5a0441baa36043a6ec4509d [2024-11-12 07:12:56,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:12:56,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:12:56,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:12:56,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:12:56,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:12:56,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:12:56" (1/1) ... [2024-11-12 07:12:56,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1915680b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56, skipping insertion in model container [2024-11-12 07:12:56,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:12:56" (1/1) ... [2024-11-12 07:12:56,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:12:56,639 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-7.i[915,928] [2024-11-12 07:12:56,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:12:56,728 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:12:56,742 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-7.i[915,928] [2024-11-12 07:12:56,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:12:56,827 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:12:56,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56 WrapperNode [2024-11-12 07:12:56,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:12:56,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:12:56,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:12:56,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:12:56,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56" (1/1) ... [2024-11-12 07:12:56,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56" (1/1) ... [2024-11-12 07:12:56,908 INFO L138 Inliner]: procedures = 39, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 484 [2024-11-12 07:12:56,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:12:56,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:12:56,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:12:56,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:12:56,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56" (1/1) ... [2024-11-12 07:12:56,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56" (1/1) ... [2024-11-12 07:12:56,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56" (1/1) ... [2024-11-12 07:12:56,995 INFO L175 MemorySlicer]: Split 122 memory accesses to 7 slices as follows [2, 18, 28, 22, 33, 8, 11]. 27 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 2, 2, 1, 1]. The 16 writes are split as follows [0, 2, 4, 2, 4, 3, 1]. [2024-11-12 07:12:56,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56" (1/1) ... [2024-11-12 07:12:56,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56" (1/1) ... [2024-11-12 07:12:57,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56" (1/1) ... [2024-11-12 07:12:57,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56" (1/1) ... [2024-11-12 07:12:57,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56" (1/1) ... [2024-11-12 07:12:57,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56" (1/1) ... [2024-11-12 07:12:57,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:12:57,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:12:57,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:12:57,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:12:57,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56" (1/1) ... [2024-11-12 07:12:57,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:12:57,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:12:57,117 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-12 07:12:57,120 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-12 07:12:57,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:12:57,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-12 07:12:57,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-12 07:12:57,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-12 07:12:57,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-12 07:12:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-12 07:12:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-12 07:12:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-12 07:12:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-12 07:12:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-12 07:12:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-12 07:12:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-12 07:12:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-12 07:12:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-12 07:12:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-12 07:12:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:12:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:12:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 07:12:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-12 07:12:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-12 07:12:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-12 07:12:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-12 07:12:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-12 07:12:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-12 07:12:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-12 07:12:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-12 07:12:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-12 07:12:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-12 07:12:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-12 07:12:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:12:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:12:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 07:12:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-12 07:12:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-12 07:12:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-12 07:12:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-12 07:12:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-12 07:12:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-12 07:12:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-12 07:12:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-12 07:12:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-12 07:12:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-12 07:12:57,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-12 07:12:57,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:12:57,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:12:57,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-12 07:12:57,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-12 07:12:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-12 07:12:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-12 07:12:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-12 07:12:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-12 07:12:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-12 07:12:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-12 07:12:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-12 07:12:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-12 07:12:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-12 07:12:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-12 07:12:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:12:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:12:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-12 07:12:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-12 07:12:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-12 07:12:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-12 07:12:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-12 07:12:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:12:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:12:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-12 07:12:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-12 07:12:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-12 07:12:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-12 07:12:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-12 07:12:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:12:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:12:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-12 07:12:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-12 07:12:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-12 07:12:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-12 07:12:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-12 07:12:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-12 07:12:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-12 07:12:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-12 07:12:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-12 07:12:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-12 07:12:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-12 07:12:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-12 07:12:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:12:57,195 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:12:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:12:57,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:12:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:12:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:12:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-12 07:12:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-12 07:12:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-12 07:12:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-12 07:12:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-12 07:12:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:12:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:12:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-12 07:12:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-12 07:12:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-12 07:12:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-12 07:12:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-12 07:12:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:12:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:12:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-12 07:12:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-12 07:12:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-12 07:12:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-12 07:12:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-12 07:12:57,437 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:12:57,439 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:12:59,841 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-12 07:12:59,842 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:12:59,866 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:12:59,869 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:12:59,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:12:59 BoogieIcfgContainer [2024-11-12 07:12:59,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:12:59,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:12:59,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:12:59,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:12:59,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:12:56" (1/3) ... [2024-11-12 07:12:59,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e30449f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:12:59, skipping insertion in model container [2024-11-12 07:12:59,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:12:56" (2/3) ... [2024-11-12 07:12:59,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e30449f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:12:59, skipping insertion in model container [2024-11-12 07:12:59,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:12:59" (3/3) ... [2024-11-12 07:12:59,880 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-7.i [2024-11-12 07:12:59,898 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:12:59,899 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:12:59,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:12:59,968 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;@22487ede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:12:59,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:12:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 86 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:12:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:12:59,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:12:59,987 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:12:59,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:12:59,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:12:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash -147929321, now seen corresponding path program 1 times [2024-11-12 07:13:00,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:13:00,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899146998] [2024-11-12 07:13:00,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:13:00,015 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-12 07:13:00,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:13:00,019 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-12 07:13:00,021 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-12 07:13:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:13:00,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:13:00,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:13:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-12 07:13:00,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:13:00,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:13:00,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899146998] [2024-11-12 07:13:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899146998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:13:00,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:13:00,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:13:00,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001251720] [2024-11-12 07:13:00,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:13:00,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:13:00,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:13:00,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:13:00,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:13:00,572 INFO L87 Difference]: Start difference. First operand has 100 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 86 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:13:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:13:00,597 INFO L93 Difference]: Finished difference Result 193 states and 304 transitions. [2024-11-12 07:13:00,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:13:00,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-12 07:13:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:13:00,608 INFO L225 Difference]: With dead ends: 193 [2024-11-12 07:13:00,609 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 07:13:00,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-12 07:13:00,618 INFO L435 NwaCegarLoop]: 138 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, 138 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-12 07:13:00,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:13:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 07:13:00,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-12 07:13:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:13:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-12 07:13:00,683 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 103 [2024-11-12 07:13:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:13:00,684 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-12 07:13:00,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:13:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-12 07:13:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:13:00,691 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:13:00,691 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:13:00,705 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-12 07:13:00,895 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-12 07:13:00,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:13:00,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:13:00,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1365420453, now seen corresponding path program 1 times [2024-11-12 07:13:00,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:13:00,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850979883] [2024-11-12 07:13:00,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:13:00,905 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-12 07:13:00,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:13:00,907 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-12 07:13:00,908 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-12 07:13:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:13:01,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:13:01,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:13:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 07:13:01,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:13:01,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:13:01,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850979883] [2024-11-12 07:13:01,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850979883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:13:01,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:13:01,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:13:01,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665901149] [2024-11-12 07:13:01,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:13:01,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:13:01,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:13:01,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:13:01,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:13:01,361 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:13:01,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:13:01,420 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2024-11-12 07:13:01,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:13:01,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-12 07:13:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:13:01,423 INFO L225 Difference]: With dead ends: 191 [2024-11-12 07:13:01,424 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 07:13:01,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:13:01,427 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:13:01,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:13:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 07:13:01,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-12 07:13:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:13:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-12 07:13:01,447 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 103 [2024-11-12 07:13:01,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:13:01,448 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-12 07:13:01,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:13:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-12 07:13:01,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:13:01,451 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:13:01,454 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:13:01,467 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-12 07:13:01,655 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-12 07:13:01,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:13:01,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:13:01,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1406095203, now seen corresponding path program 1 times [2024-11-12 07:13:01,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:13:01,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087291456] [2024-11-12 07:13:01,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:13:01,658 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-12 07:13:01,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:13:01,664 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-12 07:13:01,665 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-12 07:13:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:13:02,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 07:13:02,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:13:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:13:02,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:13:02,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:13:02,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087291456] [2024-11-12 07:13:02,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087291456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:13:02,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:13:02,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:13:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441158447] [2024-11-12 07:13:02,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:13:02,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:13:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:13:02,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:13:02,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:13:02,052 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:13:02,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:13:02,095 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-11-12 07:13:02,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:13:02,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-12 07:13:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:13:02,098 INFO L225 Difference]: With dead ends: 194 [2024-11-12 07:13:02,099 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 07:13:02,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:13:02,101 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:13:02,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:13:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 07:13:02,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-12 07:13:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:13:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-12 07:13:02,116 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 103 [2024-11-12 07:13:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:13:02,117 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-12 07:13:02,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:13:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-12 07:13:02,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:13:02,121 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:13:02,121 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:13:02,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-12 07:13:02,322 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-12 07:13:02,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:13:02,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:13:02,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1877754843, now seen corresponding path program 1 times [2024-11-12 07:13:02,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:13:02,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499867338] [2024-11-12 07:13:02,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:13:02,324 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-12 07:13:02,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:13:02,327 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-12 07:13:02,329 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-12 07:13:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:13:02,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:13:02,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:13:02,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-11-12 07:13:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-12 07:13:03,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:13:03,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:13:03,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499867338] [2024-11-12 07:13:03,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499867338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:13:03,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:13:03,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:13:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362251346] [2024-11-12 07:13:03,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:13:03,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:13:03,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:13:03,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:13:03,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:13:03,051 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:13:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:13:05,022 INFO L93 Difference]: Finished difference Result 196 states and 280 transitions. [2024-11-12 07:13:05,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:13:05,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-12 07:13:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:13:05,030 INFO L225 Difference]: With dead ends: 196 [2024-11-12 07:13:05,030 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 07:13:05,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:13:05,035 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 112 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:13:05,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 420 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-12 07:13:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 07:13:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-12 07:13:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:13:05,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2024-11-12 07:13:05,048 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 103 [2024-11-12 07:13:05,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:13:05,048 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2024-11-12 07:13:05,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:13:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2024-11-12 07:13:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 07:13:05,050 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:13:05,050 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:13:05,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 07:13:05,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:13:05,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:13:05,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:13:05,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1650663585, now seen corresponding path program 1 times [2024-11-12 07:13:05,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:13:05,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786265217] [2024-11-12 07:13:05,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:13:05,253 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-12 07:13:05,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:13:05,256 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:13:05,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 07:13:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:13:05,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:13:05,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:13:05,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-12 07:13:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 07:13:05,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:13:05,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:13:05,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786265217] [2024-11-12 07:13:05,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786265217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:13:05,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:13:05,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:13:05,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307362228] [2024-11-12 07:13:05,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:13:05,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:13:05,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:13:05,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:13:05,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:13:05,884 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:13:07,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:13:07,639 INFO L93 Difference]: Finished difference Result 195 states and 277 transitions. [2024-11-12 07:13:07,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:13:07,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-12 07:13:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:13:07,643 INFO L225 Difference]: With dead ends: 195 [2024-11-12 07:13:07,644 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 07:13:07,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:13:07,645 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 104 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:13:07,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 415 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 07:13:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 07:13:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-12 07:13:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:13:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2024-11-12 07:13:07,652 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 105 [2024-11-12 07:13:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:13:07,653 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2024-11-12 07:13:07,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:13:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2024-11-12 07:13:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-12 07:13:07,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:13:07,655 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:13:07,669 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 (6)] Ended with exit code 0 [2024-11-12 07:13:07,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-12 07:13:07,856 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:13:07,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:13:07,857 INFO L85 PathProgramCache]: Analyzing trace with hash -299284775, now seen corresponding path program 1 times [2024-11-12 07:13:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:13:07,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969312516] [2024-11-12 07:13:07,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:13:07,857 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-12 07:13:07,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:13:07,859 INFO L229 MonitoredProcess]: Starting monitored process 7 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-12 07:13:07,861 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 (7)] Waiting until timeout for monitored process [2024-11-12 07:13:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:13:08,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:13:08,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:13:08,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 40 [2024-11-12 07:13:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 24 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-12 07:13:08,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:13:08,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-11-12 07:13:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-12 07:13:08,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:13:08,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969312516] [2024-11-12 07:13:08,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969312516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:13:08,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:13:08,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-12 07:13:08,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035699145] [2024-11-12 07:13:08,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:13:08,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:13:08,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:13:08,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:13:08,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:13:08,765 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-12 07:13:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:13:11,096 INFO L93 Difference]: Finished difference Result 204 states and 286 transitions. [2024-11-12 07:13:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:13:11,100 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 107 [2024-11-12 07:13:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:13:11,101 INFO L225 Difference]: With dead ends: 204 [2024-11-12 07:13:11,101 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 07:13:11,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:13:11,102 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 103 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:13:11,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 720 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 07:13:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 07:13:11,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-12 07:13:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:13:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 135 transitions. [2024-11-12 07:13:11,110 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 135 transitions. Word has length 107 [2024-11-12 07:13:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:13:11,111 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 135 transitions. [2024-11-12 07:13:11,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-12 07:13:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 135 transitions. [2024-11-12 07:13:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-12 07:13:11,118 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:13:11,119 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:13:11,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-12 07:13:11,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-12 07:13:11,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:13:11,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:13:11,320 INFO L85 PathProgramCache]: Analyzing trace with hash -733013861, now seen corresponding path program 1 times [2024-11-12 07:13:11,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:13:11,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952614857] [2024-11-12 07:13:11,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:13:11,321 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-12 07:13:11,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:13:11,322 INFO L229 MonitoredProcess]: Starting monitored process 8 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-12 07:13:11,323 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 (8)] Waiting until timeout for monitored process [2024-11-12 07:13:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:13:11,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 07:13:11,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:13:11,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 07:13:11,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-12 07:13:11,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:13:11,865 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 60 treesize of output 30 [2024-11-12 07:13:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:13:11,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:13:11,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:13:11,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952614857] [2024-11-12 07:13:11,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952614857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:13:11,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:13:11,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:13:11,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403041498] [2024-11-12 07:13:11,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:13:11,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:13:11,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:13:11,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:13:11,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:13:11,896 INFO L87 Difference]: Start difference. First operand 97 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:13:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:13:12,352 INFO L93 Difference]: Finished difference Result 228 states and 316 transitions. [2024-11-12 07:13:12,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:13:12,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-12 07:13:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:13:12,355 INFO L225 Difference]: With dead ends: 228 [2024-11-12 07:13:12,355 INFO L226 Difference]: Without dead ends: 134 [2024-11-12 07:13:12,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:13:12,356 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 107 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:13:12,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 548 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:13:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-12 07:13:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2024-11-12 07:13:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 07:13:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 182 transitions. [2024-11-12 07:13:12,366 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 182 transitions. Word has length 107 [2024-11-12 07:13:12,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:13:12,367 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 182 transitions. [2024-11-12 07:13:12,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:13:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 182 transitions. [2024-11-12 07:13:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 07:13:12,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:13:12,368 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:13:12,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-12 07:13:12,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-12 07:13:12,570 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:13:12,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:13:12,570 INFO L85 PathProgramCache]: Analyzing trace with hash 544746388, now seen corresponding path program 1 times [2024-11-12 07:13:12,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:13:12,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536040574] [2024-11-12 07:13:12,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:13:12,571 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-12 07:13:12,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:13:12,572 INFO L229 MonitoredProcess]: Starting monitored process 9 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-12 07:13:12,573 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 (9)] Waiting until timeout for monitored process [2024-11-12 07:13:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:13:15,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 07:13:15,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:13:15,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:13:15,864 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 64 treesize of output 24 [2024-11-12 07:13:32,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:13:32,576 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 157 treesize of output 61 [2024-11-12 07:13:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-12 07:13:38,245 INFO L312 TraceCheckSpWp]: Computing backward predicates...