./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-95.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 fc5530f3297a60a6e62c32967b204622cc9ceb16e657d6b09a8ffa710c752296 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:21:19,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:21:19,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:21:19,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:21:19,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:21:19,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:21:19,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:21:19,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:21:19,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:21:19,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:21:19,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:21:19,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:21:19,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:21:19,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:21:19,536 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:21:19,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:21:19,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:21:19,537 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:21:19,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:21:19,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:21:19,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:21:19,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:21:19,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:21:19,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:21:19,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:21:19,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:21:19,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:21:19,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:21:19,543 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:21:19,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:21:19,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:21:19,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:21:19,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:21:19,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:21:19,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:21:19,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:21:19,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:21:19,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:21:19,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:21:19,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:21:19,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:21:19,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:21:19,546 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 -> fc5530f3297a60a6e62c32967b204622cc9ceb16e657d6b09a8ffa710c752296 [2024-11-10 09:21:19,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:21:19,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:21:19,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:21:19,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:21:19,764 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:21:19,765 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-95.i [2024-11-10 09:21:21,010 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:21:21,149 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:21:21,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-95.i [2024-11-10 09:21:21,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/843bb8ec0/e3ac4721e5f247f09d70afae3bf3354f/FLAG738900e70 [2024-11-10 09:21:21,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/843bb8ec0/e3ac4721e5f247f09d70afae3bf3354f [2024-11-10 09:21:21,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:21:21,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:21:21,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:21:21,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:21:21,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:21:21,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:21" (1/1) ... [2024-11-10 09:21:21,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2b09dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21, skipping insertion in model container [2024-11-10 09:21:21,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:21" (1/1) ... [2024-11-10 09:21:21,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:21:21,342 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-95.i[916,929] [2024-11-10 09:21:21,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:21:21,405 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:21:21,414 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-95.i[916,929] [2024-11-10 09:21:21,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:21:21,459 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:21:21,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21 WrapperNode [2024-11-10 09:21:21,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:21:21,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:21:21,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:21:21,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:21:21,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21" (1/1) ... [2024-11-10 09:21:21,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21" (1/1) ... [2024-11-10 09:21:21,530 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 483 [2024-11-10 09:21:21,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:21:21,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:21:21,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:21:21,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:21:21,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21" (1/1) ... [2024-11-10 09:21:21,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21" (1/1) ... [2024-11-10 09:21:21,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21" (1/1) ... [2024-11-10 09:21:21,579 INFO L175 MemorySlicer]: Split 121 memory accesses to 7 slices as follows [2, 29, 15, 7, 7, 48, 13]. 40 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 2, 1, 1, 4, 2]. The 16 writes are split as follows [0, 4, 2, 1, 3, 4, 2]. [2024-11-10 09:21:21,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21" (1/1) ... [2024-11-10 09:21:21,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21" (1/1) ... [2024-11-10 09:21:21,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21" (1/1) ... [2024-11-10 09:21:21,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21" (1/1) ... [2024-11-10 09:21:21,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21" (1/1) ... [2024-11-10 09:21:21,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21" (1/1) ... [2024-11-10 09:21:21,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:21:21,599 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:21:21,600 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:21:21,600 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:21:21,600 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21" (1/1) ... [2024-11-10 09:21:21,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:21:21,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:21:21,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:21:21,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:21:21,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:21:21,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:21:21,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:21:21,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-10 09:21:21,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-10 09:21:21,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-10 09:21:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-10 09:21:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-10 09:21:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:21:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:21:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:21:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:21:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:21:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:21:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 09:21:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:21:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:21:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-10 09:21:21,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-10 09:21:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-10 09:21:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-10 09:21:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-10 09:21:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:21:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:21:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:21:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:21:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:21:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:21:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 09:21:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:21:21,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:21:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-10 09:21:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-10 09:21:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-10 09:21:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-10 09:21:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-10 09:21:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:21:21,679 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:21:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:21:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:21:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:21:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:21:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:21:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:21:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 09:21:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:21:21,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:21:21,806 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:21:21,808 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:21:22,145 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: havoc property_#t~mem83#1;havoc property_#t~mem89#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite88#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~bitwise94#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem99#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~bitwise114#1;havoc property_#t~ite127#1;havoc property_#t~mem119#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short131#1; [2024-11-10 09:21:22,193 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2024-11-10 09:21:22,193 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:21:22,214 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:21:22,214 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:21:22,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:22 BoogieIcfgContainer [2024-11-10 09:21:22,215 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:21:22,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:21:22,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:21:22,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:21:22,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:21:21" (1/3) ... [2024-11-10 09:21:22,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4864b854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:22, skipping insertion in model container [2024-11-10 09:21:22,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:21" (2/3) ... [2024-11-10 09:21:22,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4864b854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:22, skipping insertion in model container [2024-11-10 09:21:22,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:22" (3/3) ... [2024-11-10 09:21:22,221 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-95.i [2024-11-10 09:21:22,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:21:22,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:21:22,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:21:22,290 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;@5f4c7455, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:21:22,290 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:21:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 99 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 09:21:22,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:22,304 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:22,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:22,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:22,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1673024267, now seen corresponding path program 1 times [2024-11-10 09:21:22,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:22,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795743271] [2024-11-10 09:21:22,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:22,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:21:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:21:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:21:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:21:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:21:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:21:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:21:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:21:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:21:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:21:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:21:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:21:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:21:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:21:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:22,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:22,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795743271] [2024-11-10 09:21:22,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795743271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:22,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:22,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:21:22,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195920301] [2024-11-10 09:21:22,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:22,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:21:22,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:22,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:21:22,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:21:22,740 INFO L87 Difference]: Start difference. First operand has 117 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 99 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:22,770 INFO L93 Difference]: Finished difference Result 226 states and 349 transitions. [2024-11-10 09:21:22,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:21:22,772 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 134 [2024-11-10 09:21:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:22,778 INFO L225 Difference]: With dead ends: 226 [2024-11-10 09:21:22,778 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 09:21:22,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:21:22,784 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:22,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 09:21:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-10 09:21:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 94 states have internal predecessors, (126), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2024-11-10 09:21:22,823 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 134 [2024-11-10 09:21:22,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:22,824 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2024-11-10 09:21:22,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2024-11-10 09:21:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 09:21:22,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:22,827 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:22,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:21:22,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:22,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:22,828 INFO L85 PathProgramCache]: Analyzing trace with hash 746016825, now seen corresponding path program 1 times [2024-11-10 09:21:22,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:22,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609671808] [2024-11-10 09:21:22,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:22,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:21:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:21:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:21:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:21:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:21:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:21:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:21:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:21:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:21:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:21:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:21:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:21:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:21:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:21:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,107 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:23,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:23,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609671808] [2024-11-10 09:21:23,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609671808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:23,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:23,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:21:23,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389654678] [2024-11-10 09:21:23,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:23,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:23,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:23,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:23,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:23,113 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:23,161 INFO L93 Difference]: Finished difference Result 224 states and 317 transitions. [2024-11-10 09:21:23,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:21:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-11-10 09:21:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:23,163 INFO L225 Difference]: With dead ends: 224 [2024-11-10 09:21:23,163 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 09:21:23,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-10 09:21:23,164 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:23,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 09:21:23,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-10 09:21:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-11-10 09:21:23,183 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 134 [2024-11-10 09:21:23,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:23,186 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-11-10 09:21:23,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-11-10 09:21:23,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 09:21:23,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:23,189 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:23,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:21:23,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:23,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:23,190 INFO L85 PathProgramCache]: Analyzing trace with hash 774645976, now seen corresponding path program 1 times [2024-11-10 09:21:23,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:23,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52381242] [2024-11-10 09:21:23,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:23,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:21:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:21:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:21:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:21:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:21:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:21:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:21:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:21:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:21:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:21:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:21:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:21:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:21:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:21:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 09:21:23,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:23,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52381242] [2024-11-10 09:21:23,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52381242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:23,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954574815] [2024-11-10 09:21:23,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:23,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:21:23,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:21:23,957 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-10 09:21:23,958 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-10 09:21:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:21:24,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:24,201 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 13 treesize of output 9 [2024-11-10 09:21:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:24,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:24,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954574815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:24,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:21:24,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-10 09:21:24,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459743406] [2024-11-10 09:21:24,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:24,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:24,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:24,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:24,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:21:24,260 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:24,317 INFO L93 Difference]: Finished difference Result 227 states and 319 transitions. [2024-11-10 09:21:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:21:24,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-11-10 09:21:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:24,319 INFO L225 Difference]: With dead ends: 227 [2024-11-10 09:21:24,319 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 09:21:24,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:21:24,320 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 67 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:24,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 373 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 09:21:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-10 09:21:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2024-11-10 09:21:24,331 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 134 [2024-11-10 09:21:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:24,332 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2024-11-10 09:21:24,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2024-11-10 09:21:24,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:21:24,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:24,333 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:24,347 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-10 09:21:24,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:21:24,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:24,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2143827194, now seen corresponding path program 1 times [2024-11-10 09:21:24,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:24,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412865572] [2024-11-10 09:21:24,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:24,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:21:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:21:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:21:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:21:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:21:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:21:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:21:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:21:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:21:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:21:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:21:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:21:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:21:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:21:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 09:21:24,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:24,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412865572] [2024-11-10 09:21:24,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412865572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:24,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112692864] [2024-11-10 09:21:24,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:24,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:21:24,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:21:25,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:21:25,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 09:21:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:25,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 09:21:25,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:25,281 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 29 treesize of output 13 [2024-11-10 09:21:25,346 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 17 treesize of output 9 [2024-11-10 09:21:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-10 09:21:25,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 09:21:25,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112692864] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:21:25,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 09:21:25,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-10 09:21:25,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486227182] [2024-11-10 09:21:25,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 09:21:25,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 09:21:25,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:25,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 09:21:25,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:21:25,589 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 15 states, 13 states have (on average 6.230769230769231) internal successors, (81), 15 states have internal predecessors, (81), 5 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-10 09:21:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:25,909 INFO L93 Difference]: Finished difference Result 235 states and 325 transitions. [2024-11-10 09:21:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:21:25,909 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.230769230769231) internal successors, (81), 15 states have internal predecessors, (81), 5 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) Word has length 136 [2024-11-10 09:21:25,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:25,911 INFO L225 Difference]: With dead ends: 235 [2024-11-10 09:21:25,911 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 09:21:25,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2024-11-10 09:21:25,912 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 353 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:25,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 790 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 09:21:25,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2024-11-10 09:21:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.306930693069307) internal successors, (132), 101 states have internal predecessors, (132), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 164 transitions. [2024-11-10 09:21:25,926 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 164 transitions. Word has length 136 [2024-11-10 09:21:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:25,927 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 164 transitions. [2024-11-10 09:21:25,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.230769230769231) internal successors, (81), 15 states have internal predecessors, (81), 5 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-10 09:21:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 164 transitions. [2024-11-10 09:21:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-10 09:21:25,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:25,929 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:25,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 09:21:26,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 09:21:26,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:26,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:26,131 INFO L85 PathProgramCache]: Analyzing trace with hash 495323371, now seen corresponding path program 1 times [2024-11-10 09:21:26,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:26,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547722210] [2024-11-10 09:21:26,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:26,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:21:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:21:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:21:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:21:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:21:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:21:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:21:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:21:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:21:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:21:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:21:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:21:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:21:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:21:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:26,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:26,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547722210] [2024-11-10 09:21:26,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547722210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:26,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:26,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:21:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720825150] [2024-11-10 09:21:26,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:21:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:26,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:21:26,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:21:26,722 INFO L87 Difference]: Start difference. First operand 120 states and 164 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:27,024 INFO L93 Difference]: Finished difference Result 379 states and 520 transitions. [2024-11-10 09:21:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 09:21:27,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-10 09:21:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:27,026 INFO L225 Difference]: With dead ends: 379 [2024-11-10 09:21:27,026 INFO L226 Difference]: Without dead ends: 235 [2024-11-10 09:21:27,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:21:27,027 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 213 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:27,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 846 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:27,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-10 09:21:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 182. [2024-11-10 09:21:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 09:21:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 250 transitions. [2024-11-10 09:21:27,053 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 250 transitions. Word has length 137 [2024-11-10 09:21:27,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:27,054 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 250 transitions. [2024-11-10 09:21:27,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 250 transitions. [2024-11-10 09:21:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:21:27,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:27,055 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:27,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:21:27,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:27,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:27,056 INFO L85 PathProgramCache]: Analyzing trace with hash 296923753, now seen corresponding path program 1 times [2024-11-10 09:21:27,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:27,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165845144] [2024-11-10 09:21:27,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:27,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:21:27,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [170490783] [2024-11-10 09:21:27,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:27,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:21:27,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:21:27,156 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:21:27,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 09:21:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:21:27,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:21:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:21:27,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:21:27,754 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:21:27,755 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:21:27,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 09:21:27,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:21:27,960 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 09:21:28,072 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:21:28,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:21:28 BoogieIcfgContainer [2024-11-10 09:21:28,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:21:28,075 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:21:28,075 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:21:28,075 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:21:28,076 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:22" (3/4) ... [2024-11-10 09:21:28,077 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:21:28,078 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:21:28,079 INFO L158 Benchmark]: Toolchain (without parser) took 6901.49ms. Allocated memory was 178.3MB in the beginning and 297.8MB in the end (delta: 119.5MB). Free memory was 107.0MB in the beginning and 255.4MB in the end (delta: -148.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:21:28,079 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory was 136.7MB in the beginning and 136.6MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:21:28,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.14ms. Allocated memory is still 178.3MB. Free memory was 106.8MB in the beginning and 137.2MB in the end (delta: -30.4MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-10 09:21:28,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.16ms. Allocated memory is still 178.3MB. Free memory was 137.2MB in the beginning and 133.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:21:28,080 INFO L158 Benchmark]: Boogie Preprocessor took 66.47ms. Allocated memory is still 178.3MB. Free memory was 133.0MB in the beginning and 127.6MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:21:28,080 INFO L158 Benchmark]: IcfgBuilder took 615.79ms. Allocated memory is still 178.3MB. Free memory was 127.6MB in the beginning and 88.1MB in the end (delta: 39.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-10 09:21:28,080 INFO L158 Benchmark]: TraceAbstraction took 5857.81ms. Allocated memory was 178.3MB in the beginning and 297.8MB in the end (delta: 119.5MB). Free memory was 88.1MB in the beginning and 255.4MB in the end (delta: -167.3MB). Peak memory consumption was 126.9MB. Max. memory is 16.1GB. [2024-11-10 09:21:28,080 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 297.8MB. Free memory is still 255.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:21:28,082 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.10ms. Allocated memory is still 178.3MB. Free memory was 136.7MB in the beginning and 136.6MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.14ms. Allocated memory is still 178.3MB. Free memory was 106.8MB in the beginning and 137.2MB in the end (delta: -30.4MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.16ms. Allocated memory is still 178.3MB. Free memory was 137.2MB in the beginning and 133.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.47ms. Allocated memory is still 178.3MB. Free memory was 133.0MB in the beginning and 127.6MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 615.79ms. Allocated memory is still 178.3MB. Free memory was 127.6MB in the beginning and 88.1MB in the end (delta: 39.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5857.81ms. Allocated memory was 178.3MB in the beginning and 297.8MB in the end (delta: 119.5MB). Free memory was 88.1MB in the beginning and 255.4MB in the end (delta: -167.3MB). Peak memory consumption was 126.9MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 297.8MB. Free memory is still 255.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[2][2] = { {50.4, 8.54}, {255.8, 1.8} }; [L22-L24] float float_Array_0[2][2] = { {50.4, 8.54}, {255.8, 1.8} }; [L22-L24] float float_Array_0[2][2] = { {50.4, 8.54}, {255.8, 1.8} }; [L22-L24] float float_Array_0[2][2] = { {50.4, 8.54}, {255.8, 1.8} }; [L22-L24] float float_Array_0[2][2] = { {50.4, 8.54}, {255.8, 1.8} }; [L25-L27] signed char signed_char_Array_0[2] = { -1, -16 }; [L25-L27] signed char signed_char_Array_0[2] = { -1, -16 }; [L25-L27] signed char signed_char_Array_0[2] = { -1, -16 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -64 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -64 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 0 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 0 }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 0}, {32, 5} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 0}, {32, 5} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 0}, {32, 5} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 0}, {32, 5} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 0}, {32, 5} }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 16 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 16 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 16 }; [L40] unsigned char last_1_unsigned_char_Array_0_0__1_ = 0; VAL [float_Array_0={4:0}, isInitial=0, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] CALL updateLastVariables() [L89] EXPR unsigned_char_Array_0[0][1] [L89] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L99] RET updateLastVariables() [L100] CALL updateVariables() [L62] float_Array_0[0][0] = __VERIFIER_nondet_float() [L63] EXPR float_Array_0[0][0] [L63] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F [L63] EXPR float_Array_0[0][0] [L63] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] EXPR (float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] EXPR (float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] CALL assume_abort_if_not((float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] RET assume_abort_if_not((float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] float_Array_0[1][0] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[1][0] [L65] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F [L65] EXPR float_Array_0[1][0] [L65] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] CALL assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] RET assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] float_Array_0[0][1] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[0][1] [L67] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L67] EXPR float_Array_0[0][1] [L67] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L69] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L69] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L69] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L71] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L72] EXPR unsigned_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L73] EXPR unsigned_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 127) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L73] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 127) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L75] EXPR unsigned_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] EXPR unsigned_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L78] EXPR unsigned_char_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] EXPR unsigned_char_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR unsigned_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] EXPR unsigned_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967295) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967295) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR unsigned_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[1] != 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L100] RET updateVariables() [L101] CALL step() [L44] signed_long_int_Array_0[0] = ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))) [L45] EXPR float_Array_0[0][1] [L45] EXPR float_Array_0[1][0] [L45] EXPR float_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L45] EXPR ((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)) [L45] EXPR ((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L45] float_Array_0[1][1] = ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f))))) [L46] EXPR signed_char_Array_0[1] [L46] signed_char_Array_0[0] = signed_char_Array_0[1] [L47] EXPR signed_char_Array_0[0] [L47] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L47] EXPR signed_char_Array_0[0] & signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L47] signed long int stepLocal_0 = signed_char_Array_0[0] & signed_long_int_Array_0[0]; [L48] EXPR unsigned_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] COND TRUE (- (3351680781u - unsigned_long_int_Array_0[0])) > stepLocal_0 [L49] EXPR unsigned_char_Array_0[1][0] [L49] EXPR unsigned_char_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L49] EXPR ((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]) [L49] EXPR unsigned_char_Array_0[1][1] [L49] EXPR ((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L49] EXPR ((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))) [L49] EXPR unsigned_char_Array_0[1][0] [L49] EXPR ((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L49] EXPR unsigned_char_Array_0[0][0] [L49] unsigned_char_Array_0[0][1] = (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]) [L51] EXPR signed_char_Array_0[0] [L51] EXPR unsigned_long_int_Array_0[1] [L51] EXPR unsigned_char_Array_0[0][1] [L51] EXPR unsigned_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L51] EXPR unsigned_char_Array_0[0][1] >> unsigned_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L51] COND FALSE !((signed_char_Array_0[0] / unsigned_long_int_Array_0[1]) < (unsigned_char_Array_0[0][1] >> unsigned_char_Array_0[0][1])) [L54] EXPR signed_char_Array_0[0] [L54] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L54] COND TRUE signed_char_Array_0[0] >= signed_long_int_Array_0[0] [L55] EXPR unsigned_char_Array_0[0][0] [L55] EXPR unsigned_char_Array_0[1][1] [L55] signed_short_int_Array_0[0] = (-5 + (unsigned_char_Array_0[0][0] - unsigned_char_Array_0[1][1])) [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR signed_long_int_Array_0[0] [L92] EXPR (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f))))))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f))))))) [L92] EXPR float_Array_0[1][1] [L92] EXPR float_Array_0[0][1] [L92] EXPR float_Array_0[1][0] [L92] EXPR float_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR ((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)) [L92] EXPR ((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f))))))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR ((signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)))))))) && (((- (3351680781u - unsigned_long_int_Array_0[0])) > (signed_char_Array_0[0] & signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0][1] == ((unsigned char) (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]))) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR ((signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)))))))) && (((- (3351680781u - unsigned_long_int_Array_0[0])) > (signed_char_Array_0[0] & signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0][1] == ((unsigned char) (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]))) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR (((signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)))))))) && (((- (3351680781u - unsigned_long_int_Array_0[0])) > (signed_char_Array_0[0] & signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0][1] == ((unsigned char) (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]))) : 1)) && (((signed_char_Array_0[0] / unsigned_long_int_Array_0[1]) < (unsigned_char_Array_0[0][1] >> unsigned_char_Array_0[0][1])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((4 - unsigned_char_Array_0[1][1]) < 0 ) ? -(4 - unsigned_char_Array_0[1][1]) : (4 - unsigned_char_Array_0[1][1]))))) : ((signed_char_Array_0[0] >= signed_long_int_Array_0[0]) ? (signed_short_int_Array_0[0] == ((signed short int) (-5 + (unsigned_char_Array_0[0][0] - unsigned_char_Array_0[1][1])))) : (signed_short_int_Array_0[0] == ((signed short int) 256)))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR (((signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)))))))) && (((- (3351680781u - unsigned_long_int_Array_0[0])) > (signed_char_Array_0[0] & signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0][1] == ((unsigned char) (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]))) : 1)) && (((signed_char_Array_0[0] / unsigned_long_int_Array_0[1]) < (unsigned_char_Array_0[0][1] >> unsigned_char_Array_0[0][1])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((4 - unsigned_char_Array_0[1][1]) < 0 ) ? -(4 - unsigned_char_Array_0[1][1]) : (4 - unsigned_char_Array_0[1][1]))))) : ((signed_char_Array_0[0] >= signed_long_int_Array_0[0]) ? (signed_short_int_Array_0[0] == ((signed short int) (-5 + (unsigned_char_Array_0[0][0] - unsigned_char_Array_0[1][1])))) : (signed_short_int_Array_0[0] == ((signed short int) 256)))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR ((((signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)))))))) && (((- (3351680781u - unsigned_long_int_Array_0[0])) > (signed_char_Array_0[0] & signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0][1] == ((unsigned char) (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]))) : 1)) && (((signed_char_Array_0[0] / unsigned_long_int_Array_0[1]) < (unsigned_char_Array_0[0][1] >> unsigned_char_Array_0[0][1])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((4 - unsigned_char_Array_0[1][1]) < 0 ) ? -(4 - unsigned_char_Array_0[1][1]) : (4 - unsigned_char_Array_0[1][1]))))) : ((signed_char_Array_0[0] >= signed_long_int_Array_0[0]) ? (signed_short_int_Array_0[0] == ((signed short int) (-5 + (unsigned_char_Array_0[0][0] - unsigned_char_Array_0[1][1])))) : (signed_short_int_Array_0[0] == ((signed short int) 256))))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR ((((signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)))))))) && (((- (3351680781u - unsigned_long_int_Array_0[0])) > (signed_char_Array_0[0] & signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0][1] == ((unsigned char) (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]))) : 1)) && (((signed_char_Array_0[0] / unsigned_long_int_Array_0[1]) < (unsigned_char_Array_0[0][1] >> unsigned_char_Array_0[0][1])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((4 - unsigned_char_Array_0[1][1]) < 0 ) ? -(4 - unsigned_char_Array_0[1][1]) : (4 - unsigned_char_Array_0[1][1]))))) : ((signed_char_Array_0[0] >= signed_long_int_Array_0[0]) ? (signed_short_int_Array_0[0] == ((signed short int) (-5 + (unsigned_char_Array_0[0][0] - unsigned_char_Array_0[1][1])))) : (signed_short_int_Array_0[0] == ((signed short int) 256))))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92-L93] return ((((signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)))))))) && (((- (3351680781u - unsigned_long_int_Array_0[0])) > (signed_char_Array_0[0] & signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0][1] == ((unsigned char) (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]))) : 1)) && (((signed_char_Array_0[0] / unsigned_long_int_Array_0[1]) < (unsigned_char_Array_0[0][1] >> unsigned_char_Array_0[0][1])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((4 - unsigned_char_Array_0[1][1]) < 0 ) ? -(4 - unsigned_char_Array_0[1][1]) : (4 - unsigned_char_Array_0[1][1]))))) : ((signed_char_Array_0[0] >= signed_long_int_Array_0[0]) ? (signed_short_int_Array_0[0] == ((signed short int) (-5 + (unsigned_char_Array_0[0][0] - unsigned_char_Array_0[1][1])))) : (signed_short_int_Array_0[0] == ((signed short int) 256))))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 646 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 634 mSDsluCounter, 2607 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1896 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 657 IncrementalHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 711 mSDtfsCounter, 657 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=5, InterpolantAutomatonStates: 33, 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, 60 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1223 NumberOfCodeBlocks, 1223 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1073 ConstructedInterpolants, 0 QuantifiedInterpolants, 2039 SizeOfPredicates, 11 NumberOfNonLiveVariables, 946 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 3804/3840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:21:28,113 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-95.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 fc5530f3297a60a6e62c32967b204622cc9ceb16e657d6b09a8ffa710c752296 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:21:29,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:21:29,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:21:29,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:21:29,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:21:29,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:21:29,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:21:29,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:21:29,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:21:29,964 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:21:29,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:21:29,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:21:29,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:21:29,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:21:29,965 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:21:29,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:21:29,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:21:29,965 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:21:29,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:21:29,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:21:29,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:21:29,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:21:29,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:21:29,968 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:21:29,968 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:21:29,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:21:29,968 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:21:29,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:21:29,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:21:29,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:21:29,969 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:21:29,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:21:29,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:21:29,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:21:29,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:21:29,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:21:29,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:21:29,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:21:29,970 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:21:29,970 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:21:29,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:21:29,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:21:29,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:21:29,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:21:29,972 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 -> fc5530f3297a60a6e62c32967b204622cc9ceb16e657d6b09a8ffa710c752296 [2024-11-10 09:21:30,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:21:30,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:21:30,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:21:30,238 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:21:30,239 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:21:30,240 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-95.i [2024-11-10 09:21:31,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:21:31,678 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:21:31,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-95.i [2024-11-10 09:21:31,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f61e5add5/8b538b01424349f7b655eb7c302c6a4f/FLAG42aa99b5a [2024-11-10 09:21:31,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f61e5add5/8b538b01424349f7b655eb7c302c6a4f [2024-11-10 09:21:31,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:21:31,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:21:31,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:21:31,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:21:31,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:21:31,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:31" (1/1) ... [2024-11-10 09:21:31,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afebb31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:31, skipping insertion in model container [2024-11-10 09:21:31,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:31" (1/1) ... [2024-11-10 09:21:31,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:21:31,879 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-95.i[916,929] [2024-11-10 09:21:31,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:21:31,971 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:21:31,982 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-95.i[916,929] [2024-11-10 09:21:32,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:21:32,052 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:21:32,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:32 WrapperNode [2024-11-10 09:21:32,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:21:32,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:21:32,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:21:32,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:21:32,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:32" (1/1) ... [2024-11-10 09:21:32,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:32" (1/1) ... [2024-11-10 09:21:32,116 INFO L138 Inliner]: procedures = 36, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2024-11-10 09:21:32,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:21:32,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:21:32,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:21:32,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:21:32,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:32" (1/1) ... [2024-11-10 09:21:32,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:32" (1/1) ... [2024-11-10 09:21:32,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:32" (1/1) ... [2024-11-10 09:21:32,160 INFO L175 MemorySlicer]: Split 121 memory accesses to 7 slices as follows [2, 29, 15, 7, 7, 48, 13]. 40 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 2, 1, 1, 4, 2]. The 16 writes are split as follows [0, 4, 2, 1, 3, 4, 2]. [2024-11-10 09:21:32,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:32" (1/1) ... [2024-11-10 09:21:32,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:32" (1/1) ... [2024-11-10 09:21:32,184 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:32" (1/1) ... [2024-11-10 09:21:32,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:32" (1/1) ... [2024-11-10 09:21:32,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:32" (1/1) ... [2024-11-10 09:21:32,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:32" (1/1) ... [2024-11-10 09:21:32,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:21:32,208 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:21:32,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:21:32,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:21:32,210 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:32" (1/1) ... [2024-11-10 09:21:32,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:21:32,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:21:32,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:21:32,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:21:32,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:21:32,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:21:32,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:21:32,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 09:21:32,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-10 09:21:32,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-10 09:21:32,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-10 09:21:32,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-10 09:21:32,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-10 09:21:32,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-10 09:21:32,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-10 09:21:32,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-10 09:21:32,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-10 09:21:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-10 09:21:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-10 09:21:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:21:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:21:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 09:21:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-10 09:21:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-10 09:21:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-10 09:21:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-10 09:21:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 09:21:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 09:21:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-10 09:21:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-10 09:21:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-10 09:21:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-10 09:21:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-10 09:21:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 09:21:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 09:21:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-10 09:21:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-10 09:21:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-10 09:21:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-10 09:21:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-10 09:21:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 09:21:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 09:21:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 09:21:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-10 09:21:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-10 09:21:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-10 09:21:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-10 09:21:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-10 09:21:32,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-10 09:21:32,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-10 09:21:32,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-10 09:21:32,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-10 09:21:32,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-10 09:21:32,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-10 09:21:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 09:21:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 09:21:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-10 09:21:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-10 09:21:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-10 09:21:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-10 09:21:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-10 09:21:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-10 09:21:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-10 09:21:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-10 09:21:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-10 09:21:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-10 09:21:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-10 09:21:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-10 09:21:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:21:32,296 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:21:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:21:32,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:21:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:21:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:21:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-10 09:21:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-10 09:21:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-10 09:21:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-10 09:21:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-10 09:21:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-10 09:21:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-10 09:21:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-10 09:21:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-10 09:21:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-10 09:21:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-10 09:21:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-10 09:21:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 09:21:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 09:21:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 09:21:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-10 09:21:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-10 09:21:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-10 09:21:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-10 09:21:32,444 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:21:32,446 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:21:33,192 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: havoc property_#t~mem81#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem96#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem103#1;havoc property_#t~short106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite123#1;havoc property_#t~mem115#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2024-11-10 09:21:33,217 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-10 09:21:33,217 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:21:33,228 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:21:33,229 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:21:33,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:33 BoogieIcfgContainer [2024-11-10 09:21:33,229 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:21:33,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:21:33,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:21:33,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:21:33,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:21:31" (1/3) ... [2024-11-10 09:21:33,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3083991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:33, skipping insertion in model container [2024-11-10 09:21:33,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:32" (2/3) ... [2024-11-10 09:21:33,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3083991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:33, skipping insertion in model container [2024-11-10 09:21:33,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:33" (3/3) ... [2024-11-10 09:21:33,237 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-95.i [2024-11-10 09:21:33,261 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:21:33,261 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:21:33,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:21:33,315 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;@15714cf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:21:33,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:21:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 88 states have internal predecessors, (121), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 09:21:33,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:33,333 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:33,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:33,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:33,338 INFO L85 PathProgramCache]: Analyzing trace with hash 370201695, now seen corresponding path program 1 times [2024-11-10 09:21:33,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:33,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828126745] [2024-11-10 09:21:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:33,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:33,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:33,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:33,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 09:21:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:33,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:21:33,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-10 09:21:33,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:33,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:33,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828126745] [2024-11-10 09:21:33,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828126745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:33,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:33,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:21:33,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050166558] [2024-11-10 09:21:33,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:33,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:21:33,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:33,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:21:33,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:21:33,790 INFO L87 Difference]: Start difference. First operand has 106 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 88 states have internal predecessors, (121), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:33,813 INFO L93 Difference]: Finished difference Result 204 states and 315 transitions. [2024-11-10 09:21:33,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:21:33,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-11-10 09:21:33,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:33,820 INFO L225 Difference]: With dead ends: 204 [2024-11-10 09:21:33,820 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 09:21:33,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:21:33,826 INFO L432 NwaCegarLoop]: 141 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, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:33,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:33,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 09:21:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-10 09:21:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2024-11-10 09:21:33,862 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 131 [2024-11-10 09:21:33,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:33,862 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2024-11-10 09:21:33,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:33,862 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2024-11-10 09:21:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 09:21:33,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:33,865 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:33,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 09:21:34,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:34,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:34,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:34,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1156617713, now seen corresponding path program 1 times [2024-11-10 09:21:34,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:34,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80686950] [2024-11-10 09:21:34,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:34,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:34,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:34,070 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:34,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 09:21:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:34,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:21:34,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:34,528 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 21 treesize of output 9 [2024-11-10 09:21:34,761 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-10 09:21:34,827 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 54 treesize of output 42 [2024-11-10 09:21:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:34,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:34,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:34,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80686950] [2024-11-10 09:21:34,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80686950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:34,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:34,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:34,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495758501] [2024-11-10 09:21:34,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:34,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:34,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:34,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:34,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:34,841 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:35,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:35,955 INFO L93 Difference]: Finished difference Result 389 states and 546 transitions. [2024-11-10 09:21:35,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:21:35,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-10 09:21:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:35,961 INFO L225 Difference]: With dead ends: 389 [2024-11-10 09:21:35,964 INFO L226 Difference]: Without dead ends: 291 [2024-11-10 09:21:35,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:21:35,965 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 260 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:35,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 681 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 09:21:35,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-10 09:21:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 203. [2024-11-10 09:21:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 168 states have (on average 1.3214285714285714) internal successors, (222), 168 states have internal predecessors, (222), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 09:21:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 286 transitions. [2024-11-10 09:21:35,991 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 286 transitions. Word has length 131 [2024-11-10 09:21:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:35,992 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 286 transitions. [2024-11-10 09:21:35,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 286 transitions. [2024-11-10 09:21:35,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:21:35,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:35,997 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:36,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 09:21:36,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:36,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:36,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash 900123987, now seen corresponding path program 1 times [2024-11-10 09:21:36,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:36,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83880767] [2024-11-10 09:21:36,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:36,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:36,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:36,201 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:36,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 09:21:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:36,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:21:36,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:36,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:36,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:36,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83880767] [2024-11-10 09:21:36,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83880767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:36,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:36,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:36,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466160223] [2024-11-10 09:21:36,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:36,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:36,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:36,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:36,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:36,620 INFO L87 Difference]: Start difference. First operand 203 states and 286 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:36,665 INFO L93 Difference]: Finished difference Result 413 states and 583 transitions. [2024-11-10 09:21:36,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:36,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-10 09:21:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:36,667 INFO L225 Difference]: With dead ends: 413 [2024-11-10 09:21:36,667 INFO L226 Difference]: Without dead ends: 213 [2024-11-10 09:21:36,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:36,668 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:36,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 531 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-10 09:21:36,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2024-11-10 09:21:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 176 states have (on average 1.3068181818181819) internal successors, (230), 176 states have internal predecessors, (230), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 09:21:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 294 transitions. [2024-11-10 09:21:36,688 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 294 transitions. Word has length 133 [2024-11-10 09:21:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:36,688 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 294 transitions. [2024-11-10 09:21:36,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 294 transitions. [2024-11-10 09:21:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:21:36,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:36,690 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:36,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 09:21:36,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:36,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:36,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:36,892 INFO L85 PathProgramCache]: Analyzing trace with hash 928753138, now seen corresponding path program 1 times [2024-11-10 09:21:36,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:36,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546310240] [2024-11-10 09:21:36,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:36,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:36,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:36,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:36,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 09:21:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:37,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:21:37,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:37,317 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-10 09:21:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:37,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:37,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:37,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546310240] [2024-11-10 09:21:37,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546310240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:37,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:37,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:37,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687817256] [2024-11-10 09:21:37,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:37,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:37,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:37,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:37,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:37,342 INFO L87 Difference]: Start difference. First operand 211 states and 294 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:38,095 INFO L93 Difference]: Finished difference Result 421 states and 587 transitions. [2024-11-10 09:21:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:21:38,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-10 09:21:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:38,104 INFO L225 Difference]: With dead ends: 421 [2024-11-10 09:21:38,104 INFO L226 Difference]: Without dead ends: 213 [2024-11-10 09:21:38,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:21:38,105 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 135 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:38,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 447 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:21:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-10 09:21:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2024-11-10 09:21:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 176 states have (on average 1.2954545454545454) internal successors, (228), 176 states have internal predecessors, (228), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 09:21:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2024-11-10 09:21:38,119 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 133 [2024-11-10 09:21:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:38,120 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2024-11-10 09:21:38,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2024-11-10 09:21:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:21:38,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:38,121 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:38,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 09:21:38,322 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-10 09:21:38,322 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:38,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:38,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1227439344, now seen corresponding path program 1 times [2024-11-10 09:21:38,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:38,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124128916] [2024-11-10 09:21:38,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:38,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:38,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:38,326 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-10 09:21:38,327 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-10 09:21:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:38,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:21:38,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:38,763 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-10 09:21:38,780 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:21:38,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:38,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:38,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124128916] [2024-11-10 09:21:38,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124128916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:38,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:38,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:38,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063035111] [2024-11-10 09:21:38,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:38,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:38,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:38,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:38,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:38,784 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:39,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:39,529 INFO L93 Difference]: Finished difference Result 421 states and 583 transitions. [2024-11-10 09:21:39,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:21:39,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2024-11-10 09:21:39,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:39,536 INFO L225 Difference]: With dead ends: 421 [2024-11-10 09:21:39,537 INFO L226 Difference]: Without dead ends: 213 [2024-11-10 09:21:39,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:21:39,538 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 123 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:39,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 442 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:21:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-10 09:21:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2024-11-10 09:21:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 176 states have (on average 1.2840909090909092) internal successors, (226), 176 states have internal predecessors, (226), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 09:21:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 290 transitions. [2024-11-10 09:21:39,552 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 290 transitions. Word has length 135 [2024-11-10 09:21:39,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:39,552 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 290 transitions. [2024-11-10 09:21:39,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:39,552 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 290 transitions. [2024-11-10 09:21:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-10 09:21:39,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:39,553 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:39,569 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-10 09:21:39,754 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-10 09:21:39,755 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:39,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:39,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1589426034, now seen corresponding path program 1 times [2024-11-10 09:21:39,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:39,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102670697] [2024-11-10 09:21:39,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:39,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:39,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:39,761 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-10 09:21:39,762 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-10 09:21:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:40,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:21:40,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:40,203 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-10 09:21:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-10 09:21:40,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:40,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:40,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102670697] [2024-11-10 09:21:40,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102670697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:40,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:40,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:40,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874720813] [2024-11-10 09:21:40,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:40,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:40,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:40,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:40,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:40,231 INFO L87 Difference]: Start difference. First operand 211 states and 290 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:41,199 INFO L93 Difference]: Finished difference Result 421 states and 579 transitions. [2024-11-10 09:21:41,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:21:41,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 137 [2024-11-10 09:21:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:41,206 INFO L225 Difference]: With dead ends: 421 [2024-11-10 09:21:41,206 INFO L226 Difference]: Without dead ends: 213 [2024-11-10 09:21:41,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:21:41,207 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 114 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:41,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 437 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 09:21:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-10 09:21:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2024-11-10 09:21:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 176 states have (on average 1.2727272727272727) internal successors, (224), 176 states have internal predecessors, (224), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 09:21:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 288 transitions. [2024-11-10 09:21:41,218 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 288 transitions. Word has length 137 [2024-11-10 09:21:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:41,219 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 288 transitions. [2024-11-10 09:21:41,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 288 transitions. [2024-11-10 09:21:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:21:41,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:41,220 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:41,234 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-10 09:21:41,420 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-10 09:21:41,421 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:41,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash -531554672, now seen corresponding path program 1 times [2024-11-10 09:21:41,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:41,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81686018] [2024-11-10 09:21:41,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:41,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:41,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:41,425 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-10 09:21:41,425 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-10 09:21:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:42,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 09:21:42,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:42,094 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 21 treesize of output 9 [2024-11-10 09:21:42,196 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-10 09:21:42,267 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 27 treesize of output 11 [2024-11-10 09:21:42,361 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-10 09:21:42,391 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 15 treesize of output 7 [2024-11-10 09:21:42,396 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 26 treesize of output 18 [2024-11-10 09:21:42,400 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 14 treesize of output 10 [2024-11-10 09:21:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-10 09:21:42,431 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:42,459 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 23 treesize of output 19 [2024-11-10 09:21:42,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:42,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81686018] [2024-11-10 09:21:42,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81686018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:42,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1650217858] [2024-11-10 09:21:42,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:42,561 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 09:21:42,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 09:21:42,563 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 09:21:42,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-10 09:21:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:44,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 09:21:44,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:44,111 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 21 treesize of output 9 [2024-11-10 09:21:44,400 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-10 09:21:44,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 09:21:44,657 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 15 treesize of output 11 [2024-11-10 09:21:44,662 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 15 treesize of output 7 [2024-11-10 09:21:44,926 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 98 treesize of output 78 [2024-11-10 09:21:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-10 09:21:44,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:45,059 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 33 treesize of output 25 [2024-11-10 09:21:45,061 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 20 treesize of output 16 [2024-11-10 09:21:45,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1650217858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:45,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:21:45,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2024-11-10 09:21:45,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509104397] [2024-11-10 09:21:45,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:21:45,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 09:21:45,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:45,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 09:21:45,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2024-11-10 09:21:45,102 INFO L87 Difference]: Start difference. First operand 211 states and 288 transitions. Second operand has 19 states, 17 states have (on average 7.235294117647059) internal successors, (123), 18 states have internal predecessors, (123), 6 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-10 09:21:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:48,343 INFO L93 Difference]: Finished difference Result 468 states and 633 transitions. [2024-11-10 09:21:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 09:21:48,347 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.235294117647059) internal successors, (123), 18 states have internal predecessors, (123), 6 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) Word has length 139 [2024-11-10 09:21:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:48,348 INFO L225 Difference]: With dead ends: 468 [2024-11-10 09:21:48,348 INFO L226 Difference]: Without dead ends: 260 [2024-11-10 09:21:48,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 09:21:48,350 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 458 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:48,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1645 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-10 09:21:48,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-10 09:21:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 251. [2024-11-10 09:21:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 203 states have (on average 1.2463054187192117) internal successors, (253), 204 states have internal predecessors, (253), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-10 09:21:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 339 transitions. [2024-11-10 09:21:48,365 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 339 transitions. Word has length 139 [2024-11-10 09:21:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:48,367 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 339 transitions. [2024-11-10 09:21:48,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.235294117647059) internal successors, (123), 18 states have internal predecessors, (123), 6 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-10 09:21:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 339 transitions. [2024-11-10 09:21:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-10 09:21:48,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:48,370 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:48,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-10 09:21:48,585 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 (8)] Ended with exit code 0 [2024-11-10 09:21:48,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-10 09:21:48,771 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:48,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:48,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1344911849, now seen corresponding path program 1 times [2024-11-10 09:21:48,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:48,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114721270] [2024-11-10 09:21:48,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:48,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:48,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:48,773 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:48,780 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 (10)] Waiting until timeout for monitored process