./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-47.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 11c0c1a04c02015c2893d5de1c86170a8e4a3f2cfab36f943ed9c0f0c4cbc28a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:45:09,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:45:09,922 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 12:45:09,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:45:09,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:45:09,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:45:09,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:45:09,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:45:09,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:45:09,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:45:09,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:45:09,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:45:09,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:45:09,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:45:09,994 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:45:09,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:45:09,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:45:09,994 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:45:09,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 12:45:09,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:45:09,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:45:09,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:45:09,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:45:09,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:45:09,996 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:45:09,996 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:45:09,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:45:09,996 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:45:09,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:45:09,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:45:09,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:45:09,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:45:09,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:45:09,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:45:09,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:45:09,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:45:09,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 12:45:09,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 12:45:09,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:45:09,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:45:09,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:45:09,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:45:09,999 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 -> 11c0c1a04c02015c2893d5de1c86170a8e4a3f2cfab36f943ed9c0f0c4cbc28a [2024-11-22 12:45:10,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:45:10,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:45:10,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:45:10,261 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:45:10,261 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:45:10,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-47.i [2024-11-22 12:45:11,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:45:11,830 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:45:11,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-47.i [2024-11-22 12:45:11,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd27c663f/7a684664efed4b1f929de0a3f15bc80e/FLAG084e2947e [2024-11-22 12:45:11,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd27c663f/7a684664efed4b1f929de0a3f15bc80e [2024-11-22 12:45:11,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:45:11,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:45:11,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:45:11,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:45:11,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:45:11,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:45:11" (1/1) ... [2024-11-22 12:45:11,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c41bb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:11, skipping insertion in model container [2024-11-22 12:45:11,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:45:11" (1/1) ... [2024-11-22 12:45:11,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:45:12,047 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-ap_file-47.i[917,930] [2024-11-22 12:45:12,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:45:12,099 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:45:12,116 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-ap_file-47.i[917,930] [2024-11-22 12:45:12,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:45:12,169 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:45:12,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:12 WrapperNode [2024-11-22 12:45:12,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:45:12,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:45:12,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:45:12,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:45:12,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:12" (1/1) ... [2024-11-22 12:45:12,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:12" (1/1) ... [2024-11-22 12:45:12,216 INFO L138 Inliner]: procedures = 29, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 466 [2024-11-22 12:45:12,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:45:12,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:45:12,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:45:12,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:45:12,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:12" (1/1) ... [2024-11-22 12:45:12,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:12" (1/1) ... [2024-11-22 12:45:12,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:12" (1/1) ... [2024-11-22 12:45:12,275 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 14, 28, 57, 14]. 50 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 3, 1]. The 12 writes are split as follows [0, 2, 4, 4, 2]. [2024-11-22 12:45:12,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:12" (1/1) ... [2024-11-22 12:45:12,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:12" (1/1) ... [2024-11-22 12:45:12,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:12" (1/1) ... [2024-11-22 12:45:12,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:12" (1/1) ... [2024-11-22 12:45:12,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:12" (1/1) ... [2024-11-22 12:45:12,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:12" (1/1) ... [2024-11-22 12:45:12,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:45:12,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:45:12,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:45:12,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:45:12,328 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:12" (1/1) ... [2024-11-22 12:45:12,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:45:12,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:45:12,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 12:45:12,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 12:45:12,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:45:12,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-22 12:45:12,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-22 12:45:12,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-22 12:45:12,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-22 12:45:12,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-22 12:45:12,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 12:45:12,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 12:45:12,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 12:45:12,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 12:45:12,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 12:45:12,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-22 12:45:12,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-22 12:45:12,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-22 12:45:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-22 12:45:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-22 12:45:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 12:45:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 12:45:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 12:45:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 12:45:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 12:45:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-22 12:45:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-22 12:45:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-22 12:45:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-22 12:45:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-22 12:45:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:45:12,406 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:45:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 12:45:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 12:45:12,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 12:45:12,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 12:45:12,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 12:45:12,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:45:12,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:45:12,544 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:45:12,546 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:45:12,993 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2024-11-22 12:45:12,993 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:45:13,005 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:45:13,006 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:45:13,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:45:13 BoogieIcfgContainer [2024-11-22 12:45:13,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:45:13,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:45:13,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:45:13,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:45:13,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:45:11" (1/3) ... [2024-11-22 12:45:13,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d310221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:45:13, skipping insertion in model container [2024-11-22 12:45:13,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:12" (2/3) ... [2024-11-22 12:45:13,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d310221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:45:13, skipping insertion in model container [2024-11-22 12:45:13,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:45:13" (3/3) ... [2024-11-22 12:45:13,014 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-47.i [2024-11-22 12:45:13,030 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:45:13,030 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:45:13,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:45:13,092 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;@3ff16d95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:45:13,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:45:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:45:13,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:45:13,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:13,106 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:13,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:13,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash 683533110, now seen corresponding path program 1 times [2024-11-22 12:45:13,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:45:13,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944877552] [2024-11-22 12:45:13,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:45:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-22 12:45:13,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:45:13,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944877552] [2024-11-22 12:45:13,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944877552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:45:13,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081967146] [2024-11-22 12:45:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:13,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:45:13,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:45:13,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:45:13,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 12:45:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:13,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:45:13,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-22 12:45:13,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:45:13,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081967146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:45:13,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:45:13,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 12:45:13,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564843624] [2024-11-22 12:45:13,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:13,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:45:13,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:45:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:45:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:45:13,573 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:45:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:13,602 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-22 12:45:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:45:13,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-22 12:45:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:13,612 INFO L225 Difference]: With dead ends: 185 [2024-11-22 12:45:13,613 INFO L226 Difference]: Without dead ends: 92 [2024-11-22 12:45:13,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:45:13,621 INFO L432 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:45:13,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:45:13,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-22 12:45:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-22 12:45:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:45:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-22 12:45:13,658 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-22 12:45:13,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:13,659 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-22 12:45:13,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:45:13,659 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-22 12:45:13,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:45:13,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:13,664 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:13,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 12:45:13,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 12:45:13,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:13,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:13,866 INFO L85 PathProgramCache]: Analyzing trace with hash -310292876, now seen corresponding path program 1 times [2024-11-22 12:45:13,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:45:13,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404848015] [2024-11-22 12:45:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:13,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:45:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:45:14,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:45:14,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404848015] [2024-11-22 12:45:14,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404848015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:45:14,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:45:14,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:45:14,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490947858] [2024-11-22 12:45:14,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:14,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:45:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:45:14,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:45:14,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:45:14,073 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:14,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:14,096 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-22 12:45:14,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:45:14,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:45:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:14,100 INFO L225 Difference]: With dead ends: 182 [2024-11-22 12:45:14,100 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 12:45:14,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:45:14,102 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:45:14,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:45:14,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 12:45:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-22 12:45:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:45:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-22 12:45:14,114 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-22 12:45:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:14,120 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-22 12:45:14,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-22 12:45:14,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:45:14,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:14,125 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:14,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 12:45:14,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:14,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:14,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1999236618, now seen corresponding path program 1 times [2024-11-22 12:45:14,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:45:14,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471231885] [2024-11-22 12:45:14,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:14,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:45:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-22 12:45:14,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:45:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471231885] [2024-11-22 12:45:14,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471231885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:45:14,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107984604] [2024-11-22 12:45:14,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:14,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:45:14,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:45:14,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:45:14,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 12:45:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:14,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:45:14,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:45:14,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:45:14,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107984604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:45:14,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:45:14,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-22 12:45:14,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800109702] [2024-11-22 12:45:14,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:14,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:45:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:45:14,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:45:14,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:45:14,681 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:14,728 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-22 12:45:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:45:14,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:45:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:14,730 INFO L225 Difference]: With dead ends: 186 [2024-11-22 12:45:14,731 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 12:45:14,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:45:14,733 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:45:14,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:45:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 12:45:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-22 12:45:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:45:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-22 12:45:14,747 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 84 [2024-11-22 12:45:14,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:14,747 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-22 12:45:14,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-22 12:45:14,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:45:14,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:14,749 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:14,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 12:45:14,949 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,SelfDestructingSolverStorable2 [2024-11-22 12:45:14,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:14,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:14,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1997389576, now seen corresponding path program 1 times [2024-11-22 12:45:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:45:14,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179412717] [2024-11-22 12:45:14,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:14,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:45:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-22 12:45:15,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:45:15,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179412717] [2024-11-22 12:45:15,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179412717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:45:15,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252075887] [2024-11-22 12:45:15,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:15,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:45:15,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:45:15,141 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-22 12:45:15,143 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-22 12:45:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:15,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:45:15,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:15,383 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 13 [2024-11-22 12:45:15,389 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 31 treesize of output 15 [2024-11-22 12:45:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:45:15,425 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:45:15,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252075887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:45:15,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:45:15,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-22 12:45:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860539957] [2024-11-22 12:45:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:15,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:45:15,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:45:15,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:45:15,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:45:15,427 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:15,596 INFO L93 Difference]: Finished difference Result 248 states and 356 transitions. [2024-11-22 12:45:15,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:45:15,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:45:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:15,597 INFO L225 Difference]: With dead ends: 248 [2024-11-22 12:45:15,597 INFO L226 Difference]: Without dead ends: 156 [2024-11-22 12:45:15,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:45:15,600 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 80 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:45:15,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 478 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:45:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-22 12:45:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2024-11-22 12:45:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 137 states have internal predecessors, (191), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 12:45:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2024-11-22 12:45:15,613 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 84 [2024-11-22 12:45:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:15,614 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2024-11-22 12:45:15,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2024-11-22 12:45:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:45:15,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:15,618 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:15,624 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-22 12:45:15,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:45:15,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:15,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:15,819 INFO L85 PathProgramCache]: Analyzing trace with hash -485984406, now seen corresponding path program 1 times [2024-11-22 12:45:15,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:45:15,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669972924] [2024-11-22 12:45:15,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:15,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:45:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:45:15,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 12:45:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:45:16,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 12:45:16,004 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 12:45:16,005 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 12:45:16,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 12:45:16,009 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-22 12:45:16,082 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 12:45:16,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:45:16 BoogieIcfgContainer [2024-11-22 12:45:16,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 12:45:16,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 12:45:16,085 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 12:45:16,085 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 12:45:16,085 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:45:13" (3/4) ... [2024-11-22 12:45:16,087 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 12:45:16,088 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 12:45:16,089 INFO L158 Benchmark]: Toolchain (without parser) took 4230.18ms. Allocated memory is still 211.8MB. Free memory was 140.8MB in the beginning and 108.9MB in the end (delta: 32.0MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2024-11-22 12:45:16,089 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 119.5MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:45:16,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.95ms. Allocated memory is still 211.8MB. Free memory was 140.5MB in the beginning and 124.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 12:45:16,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.07ms. Allocated memory is still 211.8MB. Free memory was 124.8MB in the beginning and 121.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 12:45:16,090 INFO L158 Benchmark]: Boogie Preprocessor took 108.89ms. Allocated memory is still 211.8MB. Free memory was 121.7MB in the beginning and 117.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:45:16,090 INFO L158 Benchmark]: RCFGBuilder took 679.37ms. Allocated memory is still 211.8MB. Free memory was 117.5MB in the beginning and 165.9MB in the end (delta: -48.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-22 12:45:16,090 INFO L158 Benchmark]: TraceAbstraction took 3076.20ms. Allocated memory is still 211.8MB. Free memory was 165.9MB in the beginning and 109.9MB in the end (delta: 56.0MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2024-11-22 12:45:16,091 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 211.8MB. Free memory is still 108.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:45:16,092 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.15ms. Allocated memory is still 119.5MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.95ms. Allocated memory is still 211.8MB. Free memory was 140.5MB in the beginning and 124.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.07ms. Allocated memory is still 211.8MB. Free memory was 124.8MB in the beginning and 121.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.89ms. Allocated memory is still 211.8MB. Free memory was 121.7MB in the beginning and 117.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 679.37ms. Allocated memory is still 211.8MB. Free memory was 117.5MB in the beginning and 165.9MB in the end (delta: -48.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3076.20ms. Allocated memory is still 211.8MB. Free memory was 165.9MB in the beginning and 109.9MB in the end (delta: 56.0MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 211.8MB. Free memory is still 108.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27-L29] double double_Array_0[3] = { 3.5, 3.8, 24.575 }; [L27-L29] double double_Array_0[3] = { 3.5, 3.8, 24.575 }; [L27-L29] double double_Array_0[3] = { 3.5, 3.8, 24.575 }; [L27-L29] double double_Array_0[3] = { 3.5, 3.8, 24.575 }; [L30] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L31] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L32] double* double_Array_0_arraydouble_Array_0arrayVar2_Pointer = &(double_Array_0[2]); [L33-L35] signed char signed_char_Array_0[3] = { 16, 16, 4 }; [L33-L35] signed char signed_char_Array_0[3] = { 16, 16, 4 }; [L33-L35] signed char signed_char_Array_0[3] = { 16, 16, 4 }; [L33-L35] signed char signed_char_Array_0[3] = { 16, 16, 4 }; [L36] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L37] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1]); [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer = &(signed_char_Array_0[2]); [L39-L41] signed long int signed_long_int_Array_0[1] = { 8 }; [L39-L41] signed long int signed_long_int_Array_0[1] = { 8 }; [L42] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L43] signed long int last_1_signed_long_int_Array_0_0_ = 8; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=0, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] EXPR signed_long_int_Array_0[0] [L90] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L100] RET updateLastVariables() [L101] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L77] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L78] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L80] double_Array_0[0] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[0] [L81] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L81] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L81] EXPR double_Array_0[0] [L81] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L81] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L81] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L81] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L81] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L82] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L84] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L85] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L87] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L101] RET updateVariables() [L102] CALL step() [L47] COND FALSE !(-4 > last_1_signed_long_int_Array_0_0_) [L52] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L52] (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) = (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) [L54] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L54] unsigned char stepLocal_0 = ! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)); [L55] stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L55] stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L55] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L55] stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L55] COND FALSE !(stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) [L62] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L62] (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) [L63] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L63] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L63] COND FALSE !((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) <= (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) [L68] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L68] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L68] COND TRUE (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) [L69] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L69] (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L93] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L93] EXPR ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) <= (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) ? ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1) [L93] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L93] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L93] EXPR ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1 [L93] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L93] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L93] EXPR ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L93] EXPR ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) <= (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) ? ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L93] EXPR (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) <= (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) ? ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L93] EXPR (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) <= (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) ? ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L93] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) <= (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) ? ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) && (((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) : (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L93] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) <= (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) ? ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) && (((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) : (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L93] EXPR (((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) <= (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) ? ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) && (((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) : (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) : 1)) && ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L93] EXPR (((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) <= (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) ? ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) && (((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) : (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) : 1)) && ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L93-L94] return (((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) <= (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) ? ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))) && (((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) : (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) : 1)) && ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 1256 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 716 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 540 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=4, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 581 ConstructedInterpolants, 0 QuantifiedInterpolants, 665 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1043 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 944/1008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 12:45:16,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-47.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 11c0c1a04c02015c2893d5de1c86170a8e4a3f2cfab36f943ed9c0f0c4cbc28a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:45:18,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:45:18,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 12:45:18,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:45:18,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:45:18,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:45:18,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:45:18,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:45:18,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:45:18,119 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:45:18,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:45:18,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:45:18,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:45:18,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:45:18,123 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:45:18,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:45:18,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:45:18,123 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:45:18,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:45:18,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:45:18,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:45:18,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:45:18,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:45:18,125 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 12:45:18,125 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 12:45:18,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:45:18,125 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 12:45:18,126 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:45:18,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:45:18,126 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:45:18,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:45:18,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:45:18,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:45:18,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:45:18,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:45:18,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:45:18,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:45:18,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:45:18,128 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 12:45:18,128 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 12:45:18,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:45:18,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:45:18,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:45:18,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:45:18,130 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 -> 11c0c1a04c02015c2893d5de1c86170a8e4a3f2cfab36f943ed9c0f0c4cbc28a [2024-11-22 12:45:18,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:45:18,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:45:18,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:45:18,417 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:45:18,420 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:45:18,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-47.i [2024-11-22 12:45:19,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:45:19,939 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:45:19,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-47.i [2024-11-22 12:45:19,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e3d3f84c/e312258e0a0c4bad9f84da48583f8e1c/FLAGbaaa54e2e [2024-11-22 12:45:20,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e3d3f84c/e312258e0a0c4bad9f84da48583f8e1c [2024-11-22 12:45:20,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:45:20,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:45:20,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:45:20,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:45:20,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:45:20,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:45:20" (1/1) ... [2024-11-22 12:45:20,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1983267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20, skipping insertion in model container [2024-11-22 12:45:20,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:45:20" (1/1) ... [2024-11-22 12:45:20,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:45:20,518 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-ap_file-47.i[917,930] [2024-11-22 12:45:20,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:45:20,602 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:45:20,612 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-ap_file-47.i[917,930] [2024-11-22 12:45:20,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:45:20,674 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:45:20,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20 WrapperNode [2024-11-22 12:45:20,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:45:20,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:45:20,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:45:20,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:45:20,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20" (1/1) ... [2024-11-22 12:45:20,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20" (1/1) ... [2024-11-22 12:45:20,753 INFO L138 Inliner]: procedures = 33, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2024-11-22 12:45:20,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:45:20,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:45:20,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:45:20,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:45:20,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20" (1/1) ... [2024-11-22 12:45:20,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20" (1/1) ... [2024-11-22 12:45:20,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20" (1/1) ... [2024-11-22 12:45:20,799 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 14, 28, 57, 14]. 50 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 3, 1]. The 12 writes are split as follows [0, 2, 4, 4, 2]. [2024-11-22 12:45:20,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20" (1/1) ... [2024-11-22 12:45:20,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20" (1/1) ... [2024-11-22 12:45:20,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20" (1/1) ... [2024-11-22 12:45:20,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20" (1/1) ... [2024-11-22 12:45:20,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20" (1/1) ... [2024-11-22 12:45:20,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20" (1/1) ... [2024-11-22 12:45:20,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:45:20,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:45:20,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:45:20,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:45:20,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20" (1/1) ... [2024-11-22 12:45:20,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:45:20,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:45:20,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 12:45:20,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 12:45:20,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:45:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-22 12:45:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-22 12:45:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-22 12:45:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-22 12:45:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-22 12:45:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-22 12:45:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-22 12:45:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-22 12:45:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-22 12:45:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-22 12:45:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 12:45:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 12:45:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 12:45:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-22 12:45:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-22 12:45:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 12:45:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 12:45:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 12:45:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 12:45:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-22 12:45:20,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 12:45:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 12:45:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-22 12:45:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-22 12:45:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-22 12:45:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-22 12:45:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-22 12:45:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-22 12:45:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-22 12:45:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-22 12:45:20,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 12:45:20,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 12:45:20,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 12:45:20,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-22 12:45:20,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-22 12:45:20,902 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:45:20,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:45:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:45:20,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:45:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 12:45:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 12:45:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-22 12:45:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-22 12:45:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-22 12:45:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 12:45:20,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 12:45:20,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 12:45:20,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-22 12:45:20,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-22 12:45:21,018 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:45:21,020 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:45:21,471 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-11-22 12:45:21,472 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:45:21,484 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:45:21,484 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:45:21,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:45:21 BoogieIcfgContainer [2024-11-22 12:45:21,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:45:21,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:45:21,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:45:21,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:45:21,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:45:20" (1/3) ... [2024-11-22 12:45:21,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7acff821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:45:21, skipping insertion in model container [2024-11-22 12:45:21,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:20" (2/3) ... [2024-11-22 12:45:21,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7acff821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:45:21, skipping insertion in model container [2024-11-22 12:45:21,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:45:21" (3/3) ... [2024-11-22 12:45:21,490 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-47.i [2024-11-22 12:45:21,503 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:45:21,503 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:45:21,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:45:21,549 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;@336c5af5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:45:21,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:45:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:45:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:45:21,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:21,562 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:21,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:21,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:21,566 INFO L85 PathProgramCache]: Analyzing trace with hash 683533110, now seen corresponding path program 1 times [2024-11-22 12:45:21,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:45:21,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441629913] [2024-11-22 12:45:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:21,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:21,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:45:21,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:45:21,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 12:45:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:21,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:45:21,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:45:21,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:45:21,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:45:21,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441629913] [2024-11-22 12:45:21,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441629913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:45:21,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:45:21,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 12:45:21,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267914227] [2024-11-22 12:45:21,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:21,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:45:21,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:45:21,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:45:21,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:45:21,897 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:45:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:21,918 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-22 12:45:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:45:21,920 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-22 12:45:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:21,926 INFO L225 Difference]: With dead ends: 185 [2024-11-22 12:45:21,926 INFO L226 Difference]: Without dead ends: 92 [2024-11-22 12:45:21,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:45:21,931 INFO L432 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:45:21,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:45:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-22 12:45:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-22 12:45:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:45:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-22 12:45:21,964 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-22 12:45:21,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:21,964 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-22 12:45:21,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:45:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-22 12:45:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:45:21,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:21,967 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:21,976 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 (2)] Forceful destruction successful, exit code 0 [2024-11-22 12:45:22,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:22,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:22,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash -310292876, now seen corresponding path program 1 times [2024-11-22 12:45:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:45:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930869548] [2024-11-22 12:45:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:22,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:22,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:45:22,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:45:22,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 12:45:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:22,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 12:45:22,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:45:22,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:45:22,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:45:22,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930869548] [2024-11-22 12:45:22,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930869548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:45:22,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:45:22,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:45:22,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064415587] [2024-11-22 12:45:22,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:22,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:45:22,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:45:22,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:45:22,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:45:22,431 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:24,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:45:24,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:24,182 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-22 12:45:24,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:45:24,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:45:24,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:24,189 INFO L225 Difference]: With dead ends: 182 [2024-11-22 12:45:24,189 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 12:45:24,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:45:24,191 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-22 12:45:24,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-22 12:45:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 12:45:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-22 12:45:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:45:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-22 12:45:24,199 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-22 12:45:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:24,200 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-22 12:45:24,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:24,200 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-22 12:45:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:45:24,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:24,202 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:24,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 12:45:24,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:24,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:24,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:24,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1999236618, now seen corresponding path program 1 times [2024-11-22 12:45:24,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:45:24,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367472180] [2024-11-22 12:45:24,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:24,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:24,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:45:24,407 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:45:24,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 12:45:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:24,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:45:24,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:45:24,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:45:24,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:45:24,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367472180] [2024-11-22 12:45:24,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367472180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:45:24,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:45:24,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:45:24,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661896909] [2024-11-22 12:45:24,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:24,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:45:24,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:45:24,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:45:24,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:45:24,668 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:24,700 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-22 12:45:24,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:45:24,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:45:24,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:24,702 INFO L225 Difference]: With dead ends: 186 [2024-11-22 12:45:24,702 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 12:45:24,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-22 12:45:24,703 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 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-22 12:45:24,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:45:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 12:45:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-22 12:45:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:45:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-22 12:45:24,711 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2024-11-22 12:45:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:24,711 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-22 12:45:24,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-22 12:45:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:45:24,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:24,714 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:24,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 12:45:24,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:24,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:24,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash -487831448, now seen corresponding path program 1 times [2024-11-22 12:45:24,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:45:24,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497134417] [2024-11-22 12:45:24,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:24,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:24,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:45:24,921 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:45:24,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 12:45:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:25,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:45:25,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:45:25,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:45:25,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:45:25,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497134417] [2024-11-22 12:45:25,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497134417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:45:25,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:45:25,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:45:25,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229071786] [2024-11-22 12:45:25,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:25,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:45:25,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:45:25,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:45:25,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:45:25,204 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:25,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:25,251 INFO L93 Difference]: Finished difference Result 194 states and 280 transitions. [2024-11-22 12:45:25,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:45:25,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:45:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:25,252 INFO L225 Difference]: With dead ends: 194 [2024-11-22 12:45:25,252 INFO L226 Difference]: Without dead ends: 101 [2024-11-22 12:45:25,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-22 12:45:25,257 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 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-22 12:45:25,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:45:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-22 12:45:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-22 12:45:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:45:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-22 12:45:25,270 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 84 [2024-11-22 12:45:25,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:25,271 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-22 12:45:25,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-22 12:45:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:45:25,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:25,272 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:25,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 12:45:25,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:25,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:25,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:25,473 INFO L85 PathProgramCache]: Analyzing trace with hash -485984406, now seen corresponding path program 1 times [2024-11-22 12:45:25,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:45:25,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864734935] [2024-11-22 12:45:25,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:25,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:25,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:45:25,478 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:45:25,480 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-22 12:45:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:25,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 12:45:25,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:26,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:45:26,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 62 [2024-11-22 12:45:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:45:26,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:45:26,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:45:26,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864734935] [2024-11-22 12:45:26,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864734935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:45:26,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2034744994] [2024-11-22 12:45:26,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:26,889 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:45:26,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:45:26,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:45:26,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-22 12:45:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:27,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 12:45:27,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:28,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-22 12:45:29,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 62 [2024-11-22 12:45:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:45:30,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:45:30,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2034744994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:45:30,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:45:30,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-22 12:45:30,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090431562] [2024-11-22 12:45:30,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:45:30,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 12:45:30,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:45:30,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 12:45:30,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-22 12:45:30,245 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-22 12:45:31,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:31,496 INFO L93 Difference]: Finished difference Result 232 states and 332 transitions. [2024-11-22 12:45:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:45:31,498 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 84 [2024-11-22 12:45:31,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:31,499 INFO L225 Difference]: With dead ends: 232 [2024-11-22 12:45:31,501 INFO L226 Difference]: Without dead ends: 135 [2024-11-22 12:45:31,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-11-22 12:45:31,504 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 315 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:45:31,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 803 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 12:45:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-22 12:45:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-22 12:45:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 118 states have internal predecessors, (164), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 12:45:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2024-11-22 12:45:31,519 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 84 [2024-11-22 12:45:31,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:31,520 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2024-11-22 12:45:31,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-22 12:45:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2024-11-22 12:45:31,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:45:31,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:31,522 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:31,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-22 12:45:31,732 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-22 12:45:31,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-22 12:45:31,926 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:31,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:31,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1873282605, now seen corresponding path program 1 times [2024-11-22 12:45:31,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:45:31,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590065908] [2024-11-22 12:45:31,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:31,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:31,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:45:31,928 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-22 12:45:31,932 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-22 12:45:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:32,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 12:45:32,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:32,274 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 13 [2024-11-22 12:45:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:45:32,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:45:32,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:45:32,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590065908] [2024-11-22 12:45:32,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590065908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:45:32,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:45:32,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:45:32,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031217161] [2024-11-22 12:45:32,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:32,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:45:32,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:45:32,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:45:32,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:45:32,294 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:32,627 INFO L93 Difference]: Finished difference Result 473 states and 669 transitions. [2024-11-22 12:45:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:45:32,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:45:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:32,630 INFO L225 Difference]: With dead ends: 473 [2024-11-22 12:45:32,630 INFO L226 Difference]: Without dead ends: 341 [2024-11-22 12:45:32,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:45:32,631 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 226 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:45:32,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 480 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:45:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-22 12:45:32,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 317. [2024-11-22 12:45:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 276 states have (on average 1.3731884057971016) internal successors, (379), 278 states have internal predecessors, (379), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-22 12:45:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 447 transitions. [2024-11-22 12:45:32,653 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 447 transitions. Word has length 84 [2024-11-22 12:45:32,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:32,653 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 447 transitions. [2024-11-22 12:45:32,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 447 transitions. [2024-11-22 12:45:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:45:32,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:32,654 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:32,667 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-22 12:45:32,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:32,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:32,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1615117167, now seen corresponding path program 1 times [2024-11-22 12:45:32,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:45:32,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712496650] [2024-11-22 12:45:32,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:32,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:32,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:45:32,863 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:45:32,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 12:45:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:33,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:45:33,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:45:33,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:45:33,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:45:33,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712496650] [2024-11-22 12:45:33,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712496650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:45:33,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:45:33,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:45:33,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722479333] [2024-11-22 12:45:33,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:33,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:45:33,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:45:33,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:45:33,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:45:33,049 INFO L87 Difference]: Start difference. First operand 317 states and 447 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:33,446 INFO L93 Difference]: Finished difference Result 639 states and 902 transitions. [2024-11-22 12:45:33,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:45:33,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:45:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:33,451 INFO L225 Difference]: With dead ends: 639 [2024-11-22 12:45:33,452 INFO L226 Difference]: Without dead ends: 325 [2024-11-22 12:45:33,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-22 12:45:33,453 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:45:33,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 12:45:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-22 12:45:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 319. [2024-11-22 12:45:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 278 states have (on average 1.370503597122302) internal successors, (381), 280 states have internal predecessors, (381), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-22 12:45:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 449 transitions. [2024-11-22 12:45:33,476 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 449 transitions. Word has length 84 [2024-11-22 12:45:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:33,476 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 449 transitions. [2024-11-22 12:45:33,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 449 transitions. [2024-11-22 12:45:33,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:45:33,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:33,477 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:33,484 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 (9)] Forceful destruction successful, exit code 0 [2024-11-22 12:45:33,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:33,682 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:33,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:33,683 INFO L85 PathProgramCache]: Analyzing trace with hash 900801004, now seen corresponding path program 1 times [2024-11-22 12:45:33,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:45:33,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290649920] [2024-11-22 12:45:33,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:33,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:33,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:45:33,686 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-22 12:45:33,687 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 [2024-11-22 12:45:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:33,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:45:33,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:45:33,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:45:33,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:45:33,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290649920] [2024-11-22 12:45:33,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290649920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:45:33,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:45:33,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:45:33,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517649155] [2024-11-22 12:45:33,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:33,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:45:33,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:45:33,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:45:33,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:45:33,883 INFO L87 Difference]: Start difference. First operand 319 states and 449 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:45:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:33,934 INFO L93 Difference]: Finished difference Result 635 states and 895 transitions. [2024-11-22 12:45:33,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:45:33,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-22 12:45:33,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:33,937 INFO L225 Difference]: With dead ends: 635 [2024-11-22 12:45:33,937 INFO L226 Difference]: Without dead ends: 319 [2024-11-22 12:45:33,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 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-22 12:45:33,938 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:45:33,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:45:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-22 12:45:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-11-22 12:45:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 278 states have (on average 1.3597122302158273) internal successors, (378), 280 states have internal predecessors, (378), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-22 12:45:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 446 transitions. [2024-11-22 12:45:33,952 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 446 transitions. Word has length 84 [2024-11-22 12:45:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:33,952 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 446 transitions. [2024-11-22 12:45:33,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:45:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 446 transitions. [2024-11-22 12:45:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-22 12:45:33,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:33,953 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:33,960 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 (10)] Forceful destruction successful, exit code 0 [2024-11-22 12:45:34,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:34,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:34,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:34,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1394365254, now seen corresponding path program 1 times [2024-11-22 12:45:34,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:45:34,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017913330] [2024-11-22 12:45:34,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:34,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:34,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:45:34,157 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:45:34,158 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 (11)] Waiting until timeout for monitored process [2024-11-22 12:45:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:34,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:45:34,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:34,330 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 17 treesize of output 13 [2024-11-22 12:45:34,342 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 35 treesize of output 19 [2024-11-22 12:45:34,349 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 18 treesize of output 10 [2024-11-22 12:45:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:45:34,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:45:34,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:45:34,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017913330] [2024-11-22 12:45:34,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017913330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:45:34,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:45:34,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:45:34,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116934634] [2024-11-22 12:45:34,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:34,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:45:34,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:45:34,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:45:34,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:45:34,368 INFO L87 Difference]: Start difference. First operand 319 states and 446 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:34,568 INFO L93 Difference]: Finished difference Result 535 states and 746 transitions. [2024-11-22 12:45:34,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:45:34,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 85 [2024-11-22 12:45:34,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:34,570 INFO L225 Difference]: With dead ends: 535 [2024-11-22 12:45:34,570 INFO L226 Difference]: Without dead ends: 402 [2024-11-22 12:45:34,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:45:34,571 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 90 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:45:34,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 498 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:45:34,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-22 12:45:34,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2024-11-22 12:45:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 349 states have (on average 1.3553008595988538) internal successors, (473), 353 states have internal predecessors, (473), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:45:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 553 transitions. [2024-11-22 12:45:34,589 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 553 transitions. Word has length 85 [2024-11-22 12:45:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:34,589 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 553 transitions. [2024-11-22 12:45:34,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 553 transitions. [2024-11-22 12:45:34,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 12:45:34,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:34,590 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:34,597 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 (11)] Ended with exit code 0 [2024-11-22 12:45:34,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:34,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:34,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:34,795 INFO L85 PathProgramCache]: Analyzing trace with hash -384549338, now seen corresponding path program 1 times [2024-11-22 12:45:34,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:45:34,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199439255] [2024-11-22 12:45:34,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:34,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:34,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:45:34,798 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:45:34,799 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 (12)] Waiting until timeout for monitored process [2024-11-22 12:45:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:34,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:45:34,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:35,114 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 13 [2024-11-22 12:45:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:45:35,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:45:35,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:45:35,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199439255] [2024-11-22 12:45:35,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199439255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:45:35,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:45:35,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:45:35,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608596857] [2024-11-22 12:45:35,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:35,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:45:35,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:45:35,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:45:35,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:45:35,138 INFO L87 Difference]: Start difference. First operand 398 states and 553 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:35,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:35,475 INFO L93 Difference]: Finished difference Result 810 states and 1126 transitions. [2024-11-22 12:45:35,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:45:35,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-11-22 12:45:35,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:35,477 INFO L225 Difference]: With dead ends: 810 [2024-11-22 12:45:35,477 INFO L226 Difference]: Without dead ends: 415 [2024-11-22 12:45:35,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:45:35,478 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 216 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:45:35,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 479 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:45:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-22 12:45:35,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 391. [2024-11-22 12:45:35,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 342 states have (on average 1.3538011695906433) internal successors, (463), 346 states have internal predecessors, (463), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:45:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 543 transitions. [2024-11-22 12:45:35,493 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 543 transitions. Word has length 86 [2024-11-22 12:45:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:35,493 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 543 transitions. [2024-11-22 12:45:35,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 543 transitions. [2024-11-22 12:45:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 12:45:35,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:35,494 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:35,501 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 (12)] Ended with exit code 0 [2024-11-22 12:45:35,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:35,698 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:35,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:35,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1146496372, now seen corresponding path program 1 times [2024-11-22 12:45:35,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:45:35,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739085481] [2024-11-22 12:45:35,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:35,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:35,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:45:35,701 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:45:35,702 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 (13)] Waiting until timeout for monitored process [2024-11-22 12:45:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:35,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 12:45:35,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:36,339 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-22 12:45:36,674 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 31 treesize of output 26 [2024-11-22 12:45:36,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2024-11-22 12:45:37,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:45:37,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 44 [2024-11-22 12:45:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 39 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 12:45:37,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:45:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:45:37,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:45:37,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739085481] [2024-11-22 12:45:37,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739085481] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:45:37,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:45:37,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2024-11-22 12:45:37,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312817163] [2024-11-22 12:45:37,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:37,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:45:37,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:45:37,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:45:37,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-22 12:45:37,311 INFO L87 Difference]: Start difference. First operand 391 states and 543 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:45:37,618 INFO L93 Difference]: Finished difference Result 1127 states and 1559 transitions. [2024-11-22 12:45:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:45:37,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-11-22 12:45:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:45:37,623 INFO L225 Difference]: With dead ends: 1127 [2024-11-22 12:45:37,624 INFO L226 Difference]: Without dead ends: 739 [2024-11-22 12:45:37,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-22 12:45:37,625 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 103 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:45:37,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 486 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:45:37,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-22 12:45:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 484. [2024-11-22 12:45:37,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 435 states have (on average 1.3701149425287356) internal successors, (596), 439 states have internal predecessors, (596), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:45:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 676 transitions. [2024-11-22 12:45:37,653 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 676 transitions. Word has length 86 [2024-11-22 12:45:37,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:45:37,654 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 676 transitions. [2024-11-22 12:45:37,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 676 transitions. [2024-11-22 12:45:37,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 12:45:37,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:45:37,655 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:45:37,666 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 (13)] Ended with exit code 0 [2024-11-22 12:45:37,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:37,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:45:37,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:45:37,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1029109966, now seen corresponding path program 1 times [2024-11-22 12:45:37,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:45:37,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646624892] [2024-11-22 12:45:37,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:45:37,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:45:37,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:45:37,860 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:45:37,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-22 12:45:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:45:38,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 12:45:38,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:45:38,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:45:38,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 38 [2024-11-22 12:45:40,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:45:40,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 50 [2024-11-22 12:45:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:45:40,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:45:40,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:45:40,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646624892] [2024-11-22 12:45:40,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646624892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:45:40,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:45:40,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:45:40,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443165900] [2024-11-22 12:45:40,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:45:40,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:45:40,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:45:40,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:45:40,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2024-11-22 12:45:40,999 INFO L87 Difference]: Start difference. First operand 484 states and 676 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:45:45,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:45:48,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:45:52,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:45:55,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:45:57,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:46:08,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:46:12,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:46:16,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:46:20,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:46:27,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:46:31,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:46:35,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:46:39,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:46:43,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:46:47,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:46:51,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]