./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.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 f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:37:48,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:37:48,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:37:48,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:37:48,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:37:48,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:37:48,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:37:48,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:37:48,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:37:48,702 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:37:48,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:37:48,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:37:48,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:37:48,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:37:48,706 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:37:48,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:37:48,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:37:48,710 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:37:48,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:37:48,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:37:48,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:37:48,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:37:48,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:37:48,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:37:48,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:37:48,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:37:48,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:37:48,713 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:37:48,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:37:48,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:37:48,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:37:48,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:37:48,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:37:48,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:37:48,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:37:48,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:37:48,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:37:48,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:37:48,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:37:48,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:37:48,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:37:48,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:37:48,717 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 -> f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba [2024-11-19 00:37:48,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:37:49,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:37:49,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:37:49,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:37:49,032 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:37:49,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2024-11-19 00:37:50,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:37:50,702 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:37:50,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2024-11-19 00:37:50,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69ec496c/77406d27f98946d3892c137a6c9d7b8f/FLAGd3745b6f2 [2024-11-19 00:37:51,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69ec496c/77406d27f98946d3892c137a6c9d7b8f [2024-11-19 00:37:51,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:37:51,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:37:51,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:37:51,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:37:51,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:37:51,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:37:51" (1/1) ... [2024-11-19 00:37:51,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27703aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51, skipping insertion in model container [2024-11-19 00:37:51,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:37:51" (1/1) ... [2024-11-19 00:37:51,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:37:51,312 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2024-11-19 00:37:51,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:37:51,428 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:37:51,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2024-11-19 00:37:51,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:37:51,533 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:37:51,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51 WrapperNode [2024-11-19 00:37:51,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:37:51,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:37:51,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:37:51,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:37:51,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51" (1/1) ... [2024-11-19 00:37:51,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51" (1/1) ... [2024-11-19 00:37:51,602 INFO L138 Inliner]: procedures = 29, calls = 209, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 669 [2024-11-19 00:37:51,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:37:51,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:37:51,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:37:51,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:37:51,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51" (1/1) ... [2024-11-19 00:37:51,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51" (1/1) ... [2024-11-19 00:37:51,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51" (1/1) ... [2024-11-19 00:37:51,654 INFO L175 MemorySlicer]: Split 174 memory accesses to 7 slices as follows [2, 16, 44, 90, 5, 8, 9]. 52 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 3, 4, 7, 1, 1, 2]. The 19 writes are split as follows [0, 3, 4, 7, 2, 1, 2]. [2024-11-19 00:37:51,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51" (1/1) ... [2024-11-19 00:37:51,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51" (1/1) ... [2024-11-19 00:37:51,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51" (1/1) ... [2024-11-19 00:37:51,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51" (1/1) ... [2024-11-19 00:37:51,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51" (1/1) ... [2024-11-19 00:37:51,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51" (1/1) ... [2024-11-19 00:37:51,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:37:51,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:37:51,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:37:51,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:37:51,708 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51" (1/1) ... [2024-11-19 00:37:51,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:37:51,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:51,745 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-19 00:37:51,747 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-19 00:37:51,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:37:51,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:37:51,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:37:51,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:37:51,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:37:51,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:37:51,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:37:51,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-19 00:37:51,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:37:51,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:37:51,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:37:51,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:37:51,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:37:51,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:37:51,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 00:37:51,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:37:51,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:37:51,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:37:51,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:37:51,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:37:51,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:37:51,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-19 00:37:51,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:37:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:37:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:37:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:37:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:37:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:37:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 00:37:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:37:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:37:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:37:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:37:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:37:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:37:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-19 00:37:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:37:51,805 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:37:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:37:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:37:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:37:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:37:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:37:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:37:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 00:37:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:37:51,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:37:51,967 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:37:51,969 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:37:52,607 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2024-11-19 00:37:52,607 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:37:52,624 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:37:52,625 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:37:52,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:37:52 BoogieIcfgContainer [2024-11-19 00:37:52,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:37:52,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:37:52,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:37:52,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:37:52,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:37:51" (1/3) ... [2024-11-19 00:37:52,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7082d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:37:52, skipping insertion in model container [2024-11-19 00:37:52,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:51" (2/3) ... [2024-11-19 00:37:52,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7082d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:37:52, skipping insertion in model container [2024-11-19 00:37:52,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:37:52" (3/3) ... [2024-11-19 00:37:52,637 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-63.i [2024-11-19 00:37:52,654 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:37:52,654 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:37:52,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:37:52,728 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;@7871d7e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:37:52,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:37:52,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:37:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 00:37:52,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:52,752 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:52,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:52,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:52,759 INFO L85 PathProgramCache]: Analyzing trace with hash -53766804, now seen corresponding path program 1 times [2024-11-19 00:37:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:52,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974149979] [2024-11-19 00:37:52,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:52,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-19 00:37:53,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:53,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974149979] [2024-11-19 00:37:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974149979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529023559] [2024-11-19 00:37:53,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:53,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:53,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:53,205 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-19 00:37:53,206 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-19 00:37:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:53,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:37:53,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-19 00:37:53,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:53,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529023559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:53,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:53,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:37:53,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35097569] [2024-11-19 00:37:53,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:53,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:37:53,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:53,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:37:53,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:37:53,588 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:37:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:53,626 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2024-11-19 00:37:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:37:53,629 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-19 00:37:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:53,638 INFO L225 Difference]: With dead ends: 271 [2024-11-19 00:37:53,638 INFO L226 Difference]: Without dead ends: 135 [2024-11-19 00:37:53,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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-19 00:37:53,644 INFO L432 NwaCegarLoop]: 198 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, 198 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-19 00:37:53,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-19 00:37:53,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-19 00:37:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:37:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-19 00:37:53,694 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-19 00:37:53,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:53,695 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-19 00:37:53,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:37:53,695 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-19 00:37:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 00:37:53,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:53,698 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:53,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:37:53,899 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-19 00:37:53,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:53,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:53,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1541869432, now seen corresponding path program 1 times [2024-11-19 00:37:53,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:53,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219554693] [2024-11-19 00:37:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:53,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:37:54,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:54,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219554693] [2024-11-19 00:37:54,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219554693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:54,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:54,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:37:54,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583854375] [2024-11-19 00:37:54,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:54,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:37:54,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:54,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:37:54,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:37:54,260 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:37:54,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:54,327 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2024-11-19 00:37:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:37:54,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-19 00:37:54,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:54,332 INFO L225 Difference]: With dead ends: 269 [2024-11-19 00:37:54,332 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 00:37:54,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-19 00:37:54,337 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:54,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:54,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 00:37:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-19 00:37:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:37:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-19 00:37:54,358 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2024-11-19 00:37:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:54,359 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-19 00:37:54,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:37:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-19 00:37:54,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 00:37:54,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:54,366 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:54,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:37:54,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:54,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:54,367 INFO L85 PathProgramCache]: Analyzing trace with hash 246000390, now seen corresponding path program 1 times [2024-11-19 00:37:54,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:54,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914073572] [2024-11-19 00:37:54,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:54,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-19 00:37:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:54,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914073572] [2024-11-19 00:37:54,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914073572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:54,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198383495] [2024-11-19 00:37:54,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:54,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:54,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:54,733 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-19 00:37:54,735 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-19 00:37:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:54,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:37:55,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:37:55,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:55,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198383495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:55,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:55,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 00:37:55,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347318010] [2024-11-19 00:37:55,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:55,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:37:55,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:55,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:37:55,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:37:55,073 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:37:55,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:55,104 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2024-11-19 00:37:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:37:55,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-19 00:37:55,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:55,107 INFO L225 Difference]: With dead ends: 274 [2024-11-19 00:37:55,107 INFO L226 Difference]: Without dead ends: 140 [2024-11-19 00:37:55,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:37:55,109 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:55,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-19 00:37:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-11-19 00:37:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:37:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-11-19 00:37:55,119 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2024-11-19 00:37:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:55,121 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-11-19 00:37:55,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:37:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-11-19 00:37:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 00:37:55,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:55,126 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:55,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:37:55,326 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-19 00:37:55,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:55,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:55,328 INFO L85 PathProgramCache]: Analyzing trace with hash -340805624, now seen corresponding path program 1 times [2024-11-19 00:37:55,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:55,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876172411] [2024-11-19 00:37:55,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:55,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-19 00:37:55,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:55,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876172411] [2024-11-19 00:37:55,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876172411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:55,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434782149] [2024-11-19 00:37:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:55,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:55,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:55,617 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-19 00:37:55,619 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-19 00:37:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:55,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:37:55,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:37:55,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434782149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:55,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:55,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 00:37:55,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291262175] [2024-11-19 00:37:55,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:55,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:37:55,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:55,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:37:55,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:37:55,920 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:37:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:55,944 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2024-11-19 00:37:55,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:37:55,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-19 00:37:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:55,947 INFO L225 Difference]: With dead ends: 278 [2024-11-19 00:37:55,947 INFO L226 Difference]: Without dead ends: 142 [2024-11-19 00:37:55,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:37:55,948 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:55,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-19 00:37:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-11-19 00:37:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:37:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-19 00:37:55,957 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 156 [2024-11-19 00:37:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:55,958 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-19 00:37:55,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:37:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-19 00:37:55,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 00:37:55,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:55,960 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:55,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 00:37:56,161 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-19 00:37:56,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:56,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:56,163 INFO L85 PathProgramCache]: Analyzing trace with hash 339252746, now seen corresponding path program 1 times [2024-11-19 00:37:56,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:56,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633409052] [2024-11-19 00:37:56,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:56,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-19 00:37:56,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:56,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633409052] [2024-11-19 00:37:56,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633409052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:56,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841135352] [2024-11-19 00:37:56,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:56,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:56,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:56,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:37:56,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 00:37:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:56,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:37:56,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:37:56,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:56,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841135352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:56,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:56,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 00:37:56,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341941544] [2024-11-19 00:37:56,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:56,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:37:56,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:56,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:37:56,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:37:56,678 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:37:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:56,700 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2024-11-19 00:37:56,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:37:56,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-19 00:37:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:56,702 INFO L225 Difference]: With dead ends: 282 [2024-11-19 00:37:56,703 INFO L226 Difference]: Without dead ends: 144 [2024-11-19 00:37:56,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:37:56,705 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:56,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 575 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-19 00:37:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-19 00:37:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:37:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2024-11-19 00:37:56,718 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 156 [2024-11-19 00:37:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:56,718 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2024-11-19 00:37:56,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:37:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2024-11-19 00:37:56,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 00:37:56,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:56,720 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:56,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 00:37:56,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:56,921 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:56,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:56,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2114260108, now seen corresponding path program 1 times [2024-11-19 00:37:56,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:56,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110234211] [2024-11-19 00:37:56,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:56,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-19 00:37:57,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:57,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110234211] [2024-11-19 00:37:57,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110234211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:57,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499665243] [2024-11-19 00:37:57,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:57,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:57,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:57,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:37:57,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 00:37:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:57,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:37:57,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:37:57,425 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:57,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499665243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:57,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:57,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 00:37:57,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24324509] [2024-11-19 00:37:57,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:57,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:37:57,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:57,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:37:57,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:37:57,430 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:37:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:57,460 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2024-11-19 00:37:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:37:57,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-19 00:37:57,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:57,463 INFO L225 Difference]: With dead ends: 286 [2024-11-19 00:37:57,463 INFO L226 Difference]: Without dead ends: 146 [2024-11-19 00:37:57,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:37:57,465 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:57,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-19 00:37:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-19 00:37:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:37:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2024-11-19 00:37:57,481 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 156 [2024-11-19 00:37:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:57,482 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2024-11-19 00:37:57,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:37:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2024-11-19 00:37:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 00:37:57,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:57,485 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:57,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 00:37:57,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:57,686 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:57,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:57,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2116107150, now seen corresponding path program 1 times [2024-11-19 00:37:57,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:57,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977869623] [2024-11-19 00:37:57,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:57,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-19 00:37:57,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:57,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977869623] [2024-11-19 00:37:57,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977869623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:57,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575320992] [2024-11-19 00:37:57,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:57,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:57,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:57,906 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:37:57,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 00:37:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:58,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:37:58,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:37:58,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:58,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575320992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:58,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:58,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 00:37:58,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486038582] [2024-11-19 00:37:58,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:58,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:37:58,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:58,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:37:58,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:37:58,200 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:37:58,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:58,222 INFO L93 Difference]: Finished difference Result 289 states and 416 transitions. [2024-11-19 00:37:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:37:58,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-19 00:37:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:58,227 INFO L225 Difference]: With dead ends: 289 [2024-11-19 00:37:58,227 INFO L226 Difference]: Without dead ends: 147 [2024-11-19 00:37:58,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:37:58,228 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:58,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-19 00:37:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-19 00:37:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:37:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2024-11-19 00:37:58,250 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 156 [2024-11-19 00:37:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:58,253 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2024-11-19 00:37:58,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:37:58,256 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2024-11-19 00:37:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 00:37:58,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:58,258 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:37:58,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 00:37:58,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:58,459 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:58,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:58,459 INFO L85 PathProgramCache]: Analyzing trace with hash 909731529, now seen corresponding path program 1 times [2024-11-19 00:37:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:58,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414784171] [2024-11-19 00:37:58,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:58,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-19 00:37:59,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:59,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414784171] [2024-11-19 00:37:59,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414784171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:59,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305774520] [2024-11-19 00:37:59,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:59,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:59,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:59,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:37:59,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 00:37:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:59,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 00:37:59,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:59,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-19 00:38:00,004 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 83 proven. 48 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2024-11-19 00:38:00,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:38:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-19 00:38:00,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305774520] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:38:00,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:38:00,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-19 00:38:00,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507938286] [2024-11-19 00:38:00,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:38:00,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:38:00,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:00,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:38:00,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:38:00,336 INFO L87 Difference]: Start difference. First operand 147 states and 210 transitions. Second operand has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-19 00:38:00,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:00,661 INFO L93 Difference]: Finished difference Result 299 states and 424 transitions. [2024-11-19 00:38:00,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:38:00,662 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) Word has length 158 [2024-11-19 00:38:00,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:00,663 INFO L225 Difference]: With dead ends: 299 [2024-11-19 00:38:00,663 INFO L226 Difference]: Without dead ends: 155 [2024-11-19 00:38:00,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 310 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:38:00,665 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 459 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:00,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 928 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:38:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-19 00:38:00,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2024-11-19 00:38:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.353846153846154) internal successors, (176), 130 states have internal predecessors, (176), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:38:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 212 transitions. [2024-11-19 00:38:00,680 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 212 transitions. Word has length 158 [2024-11-19 00:38:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:00,682 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 212 transitions. [2024-11-19 00:38:00,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-19 00:38:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 212 transitions. [2024-11-19 00:38:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 00:38:00,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:00,685 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:00,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 00:38:00,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:38:00,886 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:00,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1084413177, now seen corresponding path program 1 times [2024-11-19 00:38:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:00,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426378424] [2024-11-19 00:38:00,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:00,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:38:01,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426378424] [2024-11-19 00:38:01,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426378424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:01,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:01,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:38:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253288218] [2024-11-19 00:38:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:01,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:38:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:01,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:38:01,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:01,452 INFO L87 Difference]: Start difference. First operand 151 states and 212 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:01,578 INFO L93 Difference]: Finished difference Result 445 states and 628 transitions. [2024-11-19 00:38:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:38:01,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-19 00:38:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:01,581 INFO L225 Difference]: With dead ends: 445 [2024-11-19 00:38:01,581 INFO L226 Difference]: Without dead ends: 297 [2024-11-19 00:38:01,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:38:01,582 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 128 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:01,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1097 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:01,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-19 00:38:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 291. [2024-11-19 00:38:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 250 states have (on average 1.36) internal successors, (340), 250 states have internal predecessors, (340), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:38:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 412 transitions. [2024-11-19 00:38:01,611 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 412 transitions. Word has length 158 [2024-11-19 00:38:01,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:01,612 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 412 transitions. [2024-11-19 00:38:01,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 412 transitions. [2024-11-19 00:38:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 00:38:01,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:01,614 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:01,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:38:01,615 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:01,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:01,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1753466944, now seen corresponding path program 1 times [2024-11-19 00:38:01,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:01,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618649443] [2024-11-19 00:38:01,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:01,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:38:02,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:02,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618649443] [2024-11-19 00:38:02,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618649443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:02,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:02,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:38:02,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527830412] [2024-11-19 00:38:02,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:02,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:02,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:02,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:02,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:02,387 INFO L87 Difference]: Start difference. First operand 291 states and 412 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:38:02,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:02,574 INFO L93 Difference]: Finished difference Result 651 states and 920 transitions. [2024-11-19 00:38:02,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:38:02,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2024-11-19 00:38:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:02,578 INFO L225 Difference]: With dead ends: 651 [2024-11-19 00:38:02,578 INFO L226 Difference]: Without dead ends: 363 [2024-11-19 00:38:02,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:38:02,579 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 167 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:02,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1149 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:02,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-19 00:38:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 362. [2024-11-19 00:38:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 302 states have (on average 1.3377483443708609) internal successors, (404), 303 states have internal predecessors, (404), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-19 00:38:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 508 transitions. [2024-11-19 00:38:02,615 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 508 transitions. Word has length 160 [2024-11-19 00:38:02,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:02,615 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 508 transitions. [2024-11-19 00:38:02,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:38:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 508 transitions. [2024-11-19 00:38:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 00:38:02,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:02,617 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:02,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:38:02,618 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:02,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1954694338, now seen corresponding path program 1 times [2024-11-19 00:38:02,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:02,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929021237] [2024-11-19 00:38:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:38:02,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:02,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929021237] [2024-11-19 00:38:02,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929021237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:02,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:02,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:38:02,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912438215] [2024-11-19 00:38:02,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:02,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:02,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:02,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:02,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:02,925 INFO L87 Difference]: Start difference. First operand 362 states and 508 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:03,168 INFO L93 Difference]: Finished difference Result 920 states and 1279 transitions. [2024-11-19 00:38:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:38:03,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-19 00:38:03,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:03,174 INFO L225 Difference]: With dead ends: 920 [2024-11-19 00:38:03,174 INFO L226 Difference]: Without dead ends: 620 [2024-11-19 00:38:03,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:03,176 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 144 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:03,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1137 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:38:03,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-19 00:38:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 502. [2024-11-19 00:38:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 421 states have (on average 1.327790973871734) internal successors, (559), 423 states have internal predecessors, (559), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-19 00:38:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 699 transitions. [2024-11-19 00:38:03,223 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 699 transitions. Word has length 160 [2024-11-19 00:38:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:03,224 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 699 transitions. [2024-11-19 00:38:03,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 699 transitions. [2024-11-19 00:38:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 00:38:03,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:03,226 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:03,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:38:03,226 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:03,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1193819284, now seen corresponding path program 1 times [2024-11-19 00:38:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:03,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745136846] [2024-11-19 00:38:03,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:03,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:38:03,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:03,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745136846] [2024-11-19 00:38:03,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745136846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:03,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:03,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:38:03,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601219258] [2024-11-19 00:38:03,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:03,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:03,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:03,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:03,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:03,881 INFO L87 Difference]: Start difference. First operand 502 states and 699 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:38:04,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:04,110 INFO L93 Difference]: Finished difference Result 830 states and 1152 transitions. [2024-11-19 00:38:04,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:38:04,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2024-11-19 00:38:04,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:04,114 INFO L225 Difference]: With dead ends: 830 [2024-11-19 00:38:04,115 INFO L226 Difference]: Without dead ends: 658 [2024-11-19 00:38:04,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:38:04,116 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 306 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:04,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1242 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-19 00:38:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 531. [2024-11-19 00:38:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 450 states have (on average 1.3355555555555556) internal successors, (601), 452 states have internal predecessors, (601), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-19 00:38:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 741 transitions. [2024-11-19 00:38:04,172 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 741 transitions. Word has length 160 [2024-11-19 00:38:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:04,173 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 741 transitions. [2024-11-19 00:38:04,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:38:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 741 transitions. [2024-11-19 00:38:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 00:38:04,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:04,175 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:04,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:38:04,175 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:04,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:04,176 INFO L85 PathProgramCache]: Analyzing trace with hash -492219410, now seen corresponding path program 1 times [2024-11-19 00:38:04,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:04,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694476509] [2024-11-19 00:38:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:04,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:38:04,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:04,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694476509] [2024-11-19 00:38:04,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694476509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:04,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:04,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:38:04,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931955623] [2024-11-19 00:38:04,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:04,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:38:04,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:04,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:38:04,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:38:04,787 INFO L87 Difference]: Start difference. First operand 531 states and 741 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:04,967 INFO L93 Difference]: Finished difference Result 899 states and 1252 transitions. [2024-11-19 00:38:04,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:38:04,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-19 00:38:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:04,972 INFO L225 Difference]: With dead ends: 899 [2024-11-19 00:38:04,972 INFO L226 Difference]: Without dead ends: 700 [2024-11-19 00:38:04,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:38:04,973 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 182 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:04,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1094 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-19 00:38:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 691. [2024-11-19 00:38:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 589 states have (on average 1.3378607809847198) internal successors, (788), 591 states have internal predecessors, (788), 88 states have call successors, (88), 13 states have call predecessors, (88), 13 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-19 00:38:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 964 transitions. [2024-11-19 00:38:05,045 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 964 transitions. Word has length 160 [2024-11-19 00:38:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:05,046 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 964 transitions. [2024-11-19 00:38:05,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 964 transitions. [2024-11-19 00:38:05,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-19 00:38:05,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:05,049 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:05,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:38:05,049 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:05,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:05,050 INFO L85 PathProgramCache]: Analyzing trace with hash 314882053, now seen corresponding path program 1 times [2024-11-19 00:38:05,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:05,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946862126] [2024-11-19 00:38:05,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:05,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:38:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:05,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946862126] [2024-11-19 00:38:05,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946862126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:05,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:05,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:38:05,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663721874] [2024-11-19 00:38:05,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:05,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:38:05,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:05,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:38:05,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:05,983 INFO L87 Difference]: Start difference. First operand 691 states and 964 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:38:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:06,139 INFO L93 Difference]: Finished difference Result 705 states and 981 transitions. [2024-11-19 00:38:06,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:38:06,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2024-11-19 00:38:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:06,144 INFO L225 Difference]: With dead ends: 705 [2024-11-19 00:38:06,144 INFO L226 Difference]: Without dead ends: 703 [2024-11-19 00:38:06,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:38:06,145 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 75 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:06,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1014 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-11-19 00:38:06,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2024-11-19 00:38:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 601 states have (on average 1.3311148086522462) internal successors, (800), 603 states have internal predecessors, (800), 88 states have call successors, (88), 13 states have call predecessors, (88), 13 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-19 00:38:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 976 transitions. [2024-11-19 00:38:06,212 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 976 transitions. Word has length 163 [2024-11-19 00:38:06,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:06,212 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 976 transitions. [2024-11-19 00:38:06,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:38:06,213 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 976 transitions. [2024-11-19 00:38:06,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-19 00:38:06,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:06,215 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:06,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:38:06,216 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:06,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:06,217 INFO L85 PathProgramCache]: Analyzing trace with hash 316729095, now seen corresponding path program 1 times [2024-11-19 00:38:06,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:06,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671266821] [2024-11-19 00:38:06,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:06,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:38:06,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:06,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671266821] [2024-11-19 00:38:06,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671266821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:06,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:06,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:38:06,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155227784] [2024-11-19 00:38:06,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:06,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:38:06,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:06,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:38:06,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:38:06,535 INFO L87 Difference]: Start difference. First operand 703 states and 976 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:06,722 INFO L93 Difference]: Finished difference Result 1364 states and 1878 transitions. [2024-11-19 00:38:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:38:06,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-19 00:38:06,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:06,726 INFO L225 Difference]: With dead ends: 1364 [2024-11-19 00:38:06,727 INFO L226 Difference]: Without dead ends: 723 [2024-11-19 00:38:06,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:06,729 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 133 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:06,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 461 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:06,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-19 00:38:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2024-11-19 00:38:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 616 states have (on average 1.3165584415584415) internal successors, (811), 618 states have internal predecessors, (811), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-19 00:38:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 987 transitions. [2024-11-19 00:38:06,788 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 987 transitions. Word has length 163 [2024-11-19 00:38:06,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:06,788 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 987 transitions. [2024-11-19 00:38:06,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 987 transitions. [2024-11-19 00:38:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-19 00:38:06,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:06,790 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:06,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:38:06,791 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:06,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:06,791 INFO L85 PathProgramCache]: Analyzing trace with hash 2091736457, now seen corresponding path program 1 times [2024-11-19 00:38:06,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:06,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348909792] [2024-11-19 00:38:06,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:06,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:38:07,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:07,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348909792] [2024-11-19 00:38:07,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348909792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:07,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:07,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:38:07,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758601880] [2024-11-19 00:38:07,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:07,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:38:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:07,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:38:07,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:38:07,010 INFO L87 Difference]: Start difference. First operand 723 states and 987 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:07,111 INFO L93 Difference]: Finished difference Result 1380 states and 1882 transitions. [2024-11-19 00:38:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:38:07,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-19 00:38:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:07,116 INFO L225 Difference]: With dead ends: 1380 [2024-11-19 00:38:07,116 INFO L226 Difference]: Without dead ends: 723 [2024-11-19 00:38:07,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:07,119 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 167 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:07,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 554 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-19 00:38:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2024-11-19 00:38:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 616 states have (on average 1.3100649350649352) internal successors, (807), 618 states have internal predecessors, (807), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-19 00:38:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 983 transitions. [2024-11-19 00:38:07,206 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 983 transitions. Word has length 163 [2024-11-19 00:38:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:07,206 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 983 transitions. [2024-11-19 00:38:07,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 983 transitions. [2024-11-19 00:38:07,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-19 00:38:07,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:07,210 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:07,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:38:07,210 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:07,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:07,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1523172469, now seen corresponding path program 1 times [2024-11-19 00:38:07,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:07,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463801332] [2024-11-19 00:38:07,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:07,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-19 00:38:07,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:38:07,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463801332] [2024-11-19 00:38:07,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463801332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:38:07,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880778776] [2024-11-19 00:38:07,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:07,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:38:07,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:38:07,436 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:38:07,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 00:38:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:07,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:38:07,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:38:07,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:07,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880778776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:07,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:38:07,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 00:38:07,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619874534] [2024-11-19 00:38:07,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:07,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:38:07,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:38:07,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:38:07,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:38:07,784 INFO L87 Difference]: Start difference. First operand 723 states and 983 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:07,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:07,856 INFO L93 Difference]: Finished difference Result 1392 states and 1890 transitions. [2024-11-19 00:38:07,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:38:07,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-19 00:38:07,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:07,861 INFO L225 Difference]: With dead ends: 1392 [2024-11-19 00:38:07,861 INFO L226 Difference]: Without dead ends: 735 [2024-11-19 00:38:07,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:38:07,864 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:07,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 760 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-19 00:38:07,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2024-11-19 00:38:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 628 states have (on average 1.3041401273885351) internal successors, (819), 630 states have internal predecessors, (819), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-19 00:38:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 995 transitions. [2024-11-19 00:38:07,924 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 995 transitions. Word has length 163 [2024-11-19 00:38:07,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:07,925 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 995 transitions. [2024-11-19 00:38:07,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 995 transitions. [2024-11-19 00:38:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-19 00:38:07,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:07,928 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:07,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 00:38:08,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 00:38:08,134 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:08,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:08,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1058859444, now seen corresponding path program 1 times [2024-11-19 00:38:08,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:38:08,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902499093] [2024-11-19 00:38:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:08,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:38:08,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:38:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:38:08,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:38:08,339 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:38:08,340 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:38:08,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 00:38:08,346 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:08,470 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:38:08,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:38:08 BoogieIcfgContainer [2024-11-19 00:38:08,473 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:38:08,474 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:38:08,474 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:38:08,474 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:38:08,475 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:37:52" (3/4) ... [2024-11-19 00:38:08,477 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:38:08,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:38:08,479 INFO L158 Benchmark]: Toolchain (without parser) took 17408.01ms. Allocated memory was 188.7MB in the beginning and 541.1MB in the end (delta: 352.3MB). Free memory was 131.7MB in the beginning and 229.1MB in the end (delta: -97.4MB). Peak memory consumption was 255.3MB. Max. memory is 16.1GB. [2024-11-19 00:38:08,479 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 188.7MB. Free memory is still 156.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:38:08,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.34ms. Allocated memory is still 188.7MB. Free memory was 131.7MB in the beginning and 114.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:38:08,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.96ms. Allocated memory is still 188.7MB. Free memory was 113.7MB in the beginning and 109.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:38:08,481 INFO L158 Benchmark]: Boogie Preprocessor took 101.54ms. Allocated memory is still 188.7MB. Free memory was 109.2MB in the beginning and 103.3MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 00:38:08,481 INFO L158 Benchmark]: RCFGBuilder took 919.26ms. Allocated memory was 188.7MB in the beginning and 253.8MB in the end (delta: 65.0MB). Free memory was 103.3MB in the beginning and 215.1MB in the end (delta: -111.8MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2024-11-19 00:38:08,481 INFO L158 Benchmark]: TraceAbstraction took 15845.72ms. Allocated memory was 253.8MB in the beginning and 541.1MB in the end (delta: 287.3MB). Free memory was 214.0MB in the beginning and 229.1MB in the end (delta: -15.1MB). Peak memory consumption was 271.1MB. Max. memory is 16.1GB. [2024-11-19 00:38:08,482 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 541.1MB. Free memory is still 229.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:38:08,483 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.18ms. Allocated memory is still 188.7MB. Free memory is still 156.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 460.34ms. Allocated memory is still 188.7MB. Free memory was 131.7MB in the beginning and 114.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.96ms. Allocated memory is still 188.7MB. Free memory was 113.7MB in the beginning and 109.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.54ms. Allocated memory is still 188.7MB. Free memory was 109.2MB in the beginning and 103.3MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 919.26ms. Allocated memory was 188.7MB in the beginning and 253.8MB in the end (delta: 65.0MB). Free memory was 103.3MB in the beginning and 215.1MB in the end (delta: -111.8MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15845.72ms. Allocated memory was 253.8MB in the beginning and 541.1MB in the end (delta: 287.3MB). Free memory was 214.0MB in the beginning and 229.1MB in the end (delta: -15.1MB). Peak memory consumption was 271.1MB. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 541.1MB. Free memory is still 229.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 128 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 128 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 256 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 256 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L40] signed short int last_1_signed_short_int_Array_0_0_ = 256; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L93] EXPR signed_short_int_Array_0[0] [L93] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] float_Array_0[0][0] = __VERIFIER_nondet_float() [L66] EXPR float_Array_0[0][0] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F [L66] EXPR float_Array_0[0][0] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] float_Array_0[1][0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[1][0] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F [L68] EXPR float_Array_0[1][0] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] CALL assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] RET assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L69] float_Array_0[0][1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[0][1] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F [L70] EXPR float_Array_0[0][1] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L71] float_Array_0[1][1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[1][1] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L72] EXPR float_Array_0[1][1] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L73] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] signed_char_Array_0[5] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR signed_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[5] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[5] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] signed_char_Array_0[6] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[6] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[6] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] EXPR signed_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L104] RET updateVariables() [L105] CALL step() [L44] EXPR unsigned_long_int_Array_0[1] [L44] unsigned_long_int_Array_0[0] = unsigned_long_int_Array_0[1] [L45] signed_short_int_Array_0[0] = last_1_signed_short_int_Array_0_0_ [L46] EXPR signed_char_Array_0[2] [L46] signed_char_Array_0[1] = signed_char_Array_0[2] [L47] EXPR BOOL_unsigned_char_Array_0[1] [L47] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L48] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) [L48] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] EXPR float_Array_0[0][1] [L48] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] COND FALSE !(((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) [L51] EXPR signed_char_Array_0[1] [L51] signed char stepLocal_0 = signed_char_Array_0[1]; [L52] EXPR signed_char_Array_0[1] [L52] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L52] EXPR ((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0]) [L52] EXPR signed_char_Array_0[1] [L52] EXPR ((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=20, unsigned_long_int_Array_0={9:0}] [L52] COND FALSE !(stepLocal_0 != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) [L55] EXPR float_Array_0[1][0] [L55] EXPR float_Array_0[1][1] [L55] EXPR float_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) [L55] EXPR float_Array_0[1][1] [L55] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] COND TRUE float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0]) [L56] EXPR signed_char_Array_0[1] [L56] EXPR signed_char_Array_0[4] [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[1] [L56] EXPR signed_char_Array_0[4] [L56] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[4] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))) [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[4] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] signed_long_int_Array_0[0] = (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) [L96] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR float_Array_0[0][1] [L96] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1 [L96] EXPR (((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) [L96] EXPR float_Array_0[1][0] [L96] EXPR float_Array_0[1][1] [L96] EXPR float_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) [L96] EXPR float_Array_0[1][1] [L96] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) [L96] EXPR signed_long_int_Array_0[0] [L96] EXPR signed_char_Array_0[1] [L96] EXPR (float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96-L97] return (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.6s, OverallIterations: 18, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1769 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1765 mSDsluCounter, 13088 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9558 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1192 IncrementalHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 3530 mSDtfsCounter, 1192 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1560 GetRequests, 1444 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=735occurred in iteration=17, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 269 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 4124 NumberOfCodeBlocks, 4124 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 4089 ConstructedInterpolants, 0 QuantifiedInterpolants, 10912 SizeOfPredicates, 1 NumberOfNonLiveVariables, 4473 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 15428/15912 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-19 00:38:08,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.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 f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:38:10,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:38:10,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:38:10,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:38:10,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:38:10,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:38:10,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:38:10,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:38:10,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:38:10,910 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:38:10,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:38:10,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:38:10,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:38:10,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:38:10,912 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:38:10,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:38:10,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:38:10,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:38:10,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:38:10,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:38:10,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:38:10,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:38:10,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:38:10,919 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:38:10,919 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:38:10,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:38:10,919 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:38:10,920 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:38:10,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:38:10,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:38:10,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:38:10,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:38:10,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:38:10,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:38:10,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:38:10,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:38:10,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:38:10,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:38:10,925 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:38:10,926 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:38:10,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:38:10,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:38:10,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:38:10,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:38:10,928 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 -> f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba [2024-11-19 00:38:11,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:38:11,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:38:11,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:38:11,296 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:38:11,297 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:38:11,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2024-11-19 00:38:12,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:38:13,006 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:38:13,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2024-11-19 00:38:13,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0c2cd6e1/2c78cd47e08a4709967328fd539e4853/FLAG031d993c8 [2024-11-19 00:38:13,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0c2cd6e1/2c78cd47e08a4709967328fd539e4853 [2024-11-19 00:38:13,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:38:13,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:38:13,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:38:13,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:38:13,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:38:13,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:38:13" (1/1) ... [2024-11-19 00:38:13,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7290c951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13, skipping insertion in model container [2024-11-19 00:38:13,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:38:13" (1/1) ... [2024-11-19 00:38:13,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:38:13,272 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2024-11-19 00:38:13,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:38:13,394 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:38:13,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2024-11-19 00:38:13,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:38:13,509 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:38:13,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13 WrapperNode [2024-11-19 00:38:13,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:38:13,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:38:13,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:38:13,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:38:13,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13" (1/1) ... [2024-11-19 00:38:13,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13" (1/1) ... [2024-11-19 00:38:13,609 INFO L138 Inliner]: procedures = 36, calls = 209, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 664 [2024-11-19 00:38:13,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:38:13,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:38:13,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:38:13,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:38:13,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13" (1/1) ... [2024-11-19 00:38:13,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13" (1/1) ... [2024-11-19 00:38:13,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13" (1/1) ... [2024-11-19 00:38:13,674 INFO L175 MemorySlicer]: Split 174 memory accesses to 7 slices as follows [2, 16, 44, 90, 5, 8, 9]. 52 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 3, 4, 7, 1, 1, 2]. The 19 writes are split as follows [0, 3, 4, 7, 2, 1, 2]. [2024-11-19 00:38:13,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13" (1/1) ... [2024-11-19 00:38:13,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13" (1/1) ... [2024-11-19 00:38:13,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13" (1/1) ... [2024-11-19 00:38:13,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13" (1/1) ... [2024-11-19 00:38:13,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13" (1/1) ... [2024-11-19 00:38:13,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13" (1/1) ... [2024-11-19 00:38:13,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:38:13,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:38:13,753 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:38:13,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:38:13,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13" (1/1) ... [2024-11-19 00:38:13,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:38:13,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:38:13,790 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-19 00:38:13,794 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-19 00:38:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:38:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:38:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:38:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:38:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:38:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:38:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:38:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 00:38:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 00:38:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 00:38:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 00:38:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 00:38:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 00:38:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 00:38:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-19 00:38:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:38:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:38:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:38:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:38:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:38:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:38:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 00:38:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:38:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:38:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:38:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:38:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:38:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 00:38:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-19 00:38:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:38:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:38:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:38:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:38:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 00:38:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-19 00:38:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-19 00:38:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:38:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:38:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:38:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:38:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:38:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 00:38:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-19 00:38:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 00:38:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 00:38:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 00:38:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 00:38:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 00:38:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-19 00:38:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-19 00:38:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:38:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:38:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:38:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:38:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 00:38:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-19 00:38:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-19 00:38:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:38:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:38:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:38:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:38:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 00:38:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-19 00:38:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-19 00:38:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:38:13,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:38:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:38:13,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:38:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:38:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:38:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:38:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:38:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:38:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:38:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 00:38:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 00:38:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 00:38:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 00:38:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 00:38:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 00:38:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-19 00:38:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-19 00:38:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:38:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:38:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:38:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:38:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:38:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-19 00:38:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-19 00:38:14,044 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:38:14,046 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:38:16,355 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-19 00:38:16,355 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:38:16,372 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:38:16,374 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:38:16,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:38:16 BoogieIcfgContainer [2024-11-19 00:38:16,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:38:16,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:38:16,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:38:16,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:38:16,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:38:13" (1/3) ... [2024-11-19 00:38:16,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aaba96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:38:16, skipping insertion in model container [2024-11-19 00:38:16,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:13" (2/3) ... [2024-11-19 00:38:16,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aaba96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:38:16, skipping insertion in model container [2024-11-19 00:38:16,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:38:16" (3/3) ... [2024-11-19 00:38:16,386 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-63.i [2024-11-19 00:38:16,402 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:38:16,403 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:38:16,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:38:16,473 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;@748666dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:38:16,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:38:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:38:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 00:38:16,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:16,490 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:16,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:16,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:16,496 INFO L85 PathProgramCache]: Analyzing trace with hash -53766804, now seen corresponding path program 1 times [2024-11-19 00:38:16,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:16,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609643116] [2024-11-19 00:38:16,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:16,511 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-19 00:38:16,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:16,515 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-19 00:38:16,516 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-19 00:38:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:17,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:38:17,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-19 00:38:17,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:17,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:17,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609643116] [2024-11-19 00:38:17,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609643116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:17,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:17,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:38:17,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186205834] [2024-11-19 00:38:17,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:17,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:38:17,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:17,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:38:17,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:38:17,189 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:38:17,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:17,224 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2024-11-19 00:38:17,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:38:17,226 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-19 00:38:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:17,234 INFO L225 Difference]: With dead ends: 271 [2024-11-19 00:38:17,234 INFO L226 Difference]: Without dead ends: 135 [2024-11-19 00:38:17,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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-19 00:38:17,241 INFO L432 NwaCegarLoop]: 198 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, 198 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-19 00:38:17,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-19 00:38:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-19 00:38:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:38:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-19 00:38:17,293 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-19 00:38:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:17,294 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-19 00:38:17,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:38:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-19 00:38:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 00:38:17,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:17,302 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:17,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 00:38:17,503 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-19 00:38:17,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:17,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1541869432, now seen corresponding path program 1 times [2024-11-19 00:38:17,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:17,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752743755] [2024-11-19 00:38:17,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:17,506 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-19 00:38:17,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:17,507 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-19 00:38:17,508 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-19 00:38:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:18,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:38:18,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-19 00:38:18,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:18,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:18,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752743755] [2024-11-19 00:38:18,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752743755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:18,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:18,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:38:18,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610593285] [2024-11-19 00:38:18,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:18,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:38:18,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:18,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:38:18,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:38:18,104 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:38:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:18,245 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2024-11-19 00:38:18,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:38:18,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-19 00:38:18,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:18,250 INFO L225 Difference]: With dead ends: 269 [2024-11-19 00:38:18,250 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 00:38:18,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 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-19 00:38:18,252 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:18,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:18,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 00:38:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-19 00:38:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:38:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-19 00:38:18,266 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2024-11-19 00:38:18,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:18,270 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-19 00:38:18,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:38:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-19 00:38:18,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 00:38:18,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:18,276 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:18,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:38:18,477 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-19 00:38:18,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:18,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:18,478 INFO L85 PathProgramCache]: Analyzing trace with hash 246000390, now seen corresponding path program 1 times [2024-11-19 00:38:18,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:18,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225784219] [2024-11-19 00:38:18,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:18,479 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-19 00:38:18,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:18,481 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-19 00:38:18,482 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-19 00:38:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:18,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:38:18,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:20,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-11-19 00:38:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-19 00:38:20,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:20,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:20,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225784219] [2024-11-19 00:38:20,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225784219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:20,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:20,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:38:20,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214238613] [2024-11-19 00:38:20,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:20,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:38:20,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:20,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:38:20,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:20,139 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:38:24,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:24,429 INFO L93 Difference]: Finished difference Result 402 states and 589 transitions. [2024-11-19 00:38:24,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:38:24,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-19 00:38:24,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:24,433 INFO L225 Difference]: With dead ends: 402 [2024-11-19 00:38:24,433 INFO L226 Difference]: Without dead ends: 268 [2024-11-19 00:38:24,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:24,435 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 307 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:24,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 718 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-19 00:38:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-19 00:38:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2024-11-19 00:38:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 226 states have (on average 1.4026548672566372) internal successors, (317), 227 states have internal predecessors, (317), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:38:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 389 transitions. [2024-11-19 00:38:24,463 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 389 transitions. Word has length 156 [2024-11-19 00:38:24,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:24,464 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 389 transitions. [2024-11-19 00:38:24,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:38:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 389 transitions. [2024-11-19 00:38:24,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 00:38:24,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:24,467 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:24,482 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-19 00:38:24,668 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-19 00:38:24,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:24,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:24,669 INFO L85 PathProgramCache]: Analyzing trace with hash 268632644, now seen corresponding path program 1 times [2024-11-19 00:38:24,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:24,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772822397] [2024-11-19 00:38:24,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:24,670 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-19 00:38:24,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:24,673 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-19 00:38:24,676 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-19 00:38:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:25,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:38:25,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:26,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-11-19 00:38:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-19 00:38:26,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:26,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:26,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772822397] [2024-11-19 00:38:26,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772822397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:26,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:26,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:38:26,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162868659] [2024-11-19 00:38:26,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:26,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:38:26,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:26,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:38:26,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:26,243 INFO L87 Difference]: Start difference. First operand 265 states and 389 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:38:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:30,672 INFO L93 Difference]: Finished difference Result 530 states and 777 transitions. [2024-11-19 00:38:30,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:38:30,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-19 00:38:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:30,676 INFO L225 Difference]: With dead ends: 530 [2024-11-19 00:38:30,676 INFO L226 Difference]: Without dead ends: 268 [2024-11-19 00:38:30,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:30,681 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 385 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:30,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 716 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-19 00:38:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-19 00:38:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2024-11-19 00:38:30,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 226 states have (on average 1.3982300884955752) internal successors, (316), 227 states have internal predecessors, (316), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:38:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 388 transitions. [2024-11-19 00:38:30,703 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 388 transitions. Word has length 156 [2024-11-19 00:38:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:30,703 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 388 transitions. [2024-11-19 00:38:30,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:38:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 388 transitions. [2024-11-19 00:38:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 00:38:30,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:30,706 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:30,723 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-19 00:38:30,906 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-19 00:38:30,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:30,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:30,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1420311098, now seen corresponding path program 1 times [2024-11-19 00:38:30,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:30,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668149459] [2024-11-19 00:38:30,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:30,909 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-19 00:38:30,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:30,912 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-19 00:38:30,913 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-19 00:38:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:31,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:38:31,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:38:31,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:31,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:31,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668149459] [2024-11-19 00:38:31,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668149459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:31,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:31,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:38:31,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610144157] [2024-11-19 00:38:31,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:31,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:38:31,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:31,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:38:31,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:38:31,382 INFO L87 Difference]: Start difference. First operand 265 states and 388 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:31,421 INFO L93 Difference]: Finished difference Result 531 states and 779 transitions. [2024-11-19 00:38:31,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:38:31,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-19 00:38:31,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:31,426 INFO L225 Difference]: With dead ends: 531 [2024-11-19 00:38:31,426 INFO L226 Difference]: Without dead ends: 269 [2024-11-19 00:38:31,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 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-19 00:38:31,428 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:31,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-19 00:38:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-19 00:38:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 230 states have (on average 1.391304347826087) internal successors, (320), 231 states have internal predecessors, (320), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:38:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 392 transitions. [2024-11-19 00:38:31,445 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 392 transitions. Word has length 156 [2024-11-19 00:38:31,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:31,446 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 392 transitions. [2024-11-19 00:38:31,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:31,447 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 392 transitions. [2024-11-19 00:38:31,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 00:38:31,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:31,449 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:31,463 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 (6)] Forceful destruction successful, exit code 0 [2024-11-19 00:38:31,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:31,650 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:31,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:31,650 INFO L85 PathProgramCache]: Analyzing trace with hash -262913791, now seen corresponding path program 1 times [2024-11-19 00:38:31,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:31,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256143483] [2024-11-19 00:38:31,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:31,651 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-19 00:38:31,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:31,652 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:31,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 00:38:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:32,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:38:32,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:32,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-19 00:38:32,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:32,661 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 50 treesize of output 26 [2024-11-19 00:38:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 83 proven. 48 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2024-11-19 00:38:32,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:38:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-19 00:38:33,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:33,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256143483] [2024-11-19 00:38:33,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256143483] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:38:33,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:38:33,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-19 00:38:33,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523777849] [2024-11-19 00:38:33,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:38:33,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:38:33,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:33,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:38:33,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:38:33,095 INFO L87 Difference]: Start difference. First operand 269 states and 392 transitions. Second operand has 12 states, 10 states have (on average 9.6) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-19 00:38:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:34,225 INFO L93 Difference]: Finished difference Result 551 states and 795 transitions. [2024-11-19 00:38:34,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:38:34,226 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 9.6) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) Word has length 158 [2024-11-19 00:38:34,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:34,229 INFO L225 Difference]: With dead ends: 551 [2024-11-19 00:38:34,229 INFO L226 Difference]: Without dead ends: 285 [2024-11-19 00:38:34,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:38:34,231 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 300 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:34,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 834 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:38:34,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-19 00:38:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 277. [2024-11-19 00:38:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 236 states have (on average 1.3728813559322033) internal successors, (324), 237 states have internal predecessors, (324), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:38:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 396 transitions. [2024-11-19 00:38:34,253 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 396 transitions. Word has length 158 [2024-11-19 00:38:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:34,254 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 396 transitions. [2024-11-19 00:38:34,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 9.6) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-19 00:38:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 396 transitions. [2024-11-19 00:38:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 00:38:34,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:34,256 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:34,271 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 (7)] Ended with exit code 0 [2024-11-19 00:38:34,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:34,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:34,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2037908799, now seen corresponding path program 1 times [2024-11-19 00:38:34,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:34,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103973616] [2024-11-19 00:38:34,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:34,458 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-19 00:38:34,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:34,460 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-19 00:38:34,460 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-19 00:38:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:34,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:38:34,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:34,898 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:38:34,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:34,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:34,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103973616] [2024-11-19 00:38:34,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103973616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:34,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:34,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:38:34,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867277691] [2024-11-19 00:38:34,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:34,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:38:34,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:34,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:38:34,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:38:34,900 INFO L87 Difference]: Start difference. First operand 277 states and 396 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:34,938 INFO L93 Difference]: Finished difference Result 557 states and 797 transitions. [2024-11-19 00:38:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:38:34,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-19 00:38:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:34,942 INFO L225 Difference]: With dead ends: 557 [2024-11-19 00:38:34,943 INFO L226 Difference]: Without dead ends: 283 [2024-11-19 00:38:34,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 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-19 00:38:34,945 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:34,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 571 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:34,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-19 00:38:34,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2024-11-19 00:38:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 240 states have (on average 1.3666666666666667) internal successors, (328), 241 states have internal predecessors, (328), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:38:34,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 400 transitions. [2024-11-19 00:38:34,963 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 400 transitions. Word has length 158 [2024-11-19 00:38:34,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:34,964 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 400 transitions. [2024-11-19 00:38:34,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:34,964 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 400 transitions. [2024-11-19 00:38:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 00:38:34,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:34,968 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:34,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 00:38:35,169 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-19 00:38:35,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:35,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1451102785, now seen corresponding path program 1 times [2024-11-19 00:38:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:35,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476724817] [2024-11-19 00:38:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:35,171 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-19 00:38:35,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:35,172 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-19 00:38:35,173 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-19 00:38:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:35,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:38:35,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:35,721 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:38:35,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:35,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:35,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476724817] [2024-11-19 00:38:35,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476724817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:35,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:35,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:38:35,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380253909] [2024-11-19 00:38:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:35,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:35,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:35,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:35,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:35,724 INFO L87 Difference]: Start difference. First operand 281 states and 400 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:35,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:35,806 INFO L93 Difference]: Finished difference Result 569 states and 811 transitions. [2024-11-19 00:38:35,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:38:35,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-19 00:38:35,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:35,809 INFO L225 Difference]: With dead ends: 569 [2024-11-19 00:38:35,809 INFO L226 Difference]: Without dead ends: 291 [2024-11-19 00:38:35,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:35,811 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:35,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 930 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-19 00:38:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2024-11-19 00:38:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 248 states have (on average 1.3548387096774193) internal successors, (336), 249 states have internal predecessors, (336), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:38:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 408 transitions. [2024-11-19 00:38:35,829 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 408 transitions. Word has length 158 [2024-11-19 00:38:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:35,829 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 408 transitions. [2024-11-19 00:38:35,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 408 transitions. [2024-11-19 00:38:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 00:38:35,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:35,832 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:35,847 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 (9)] Ended with exit code 0 [2024-11-19 00:38:36,032 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-19 00:38:36,033 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:36,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2131161155, now seen corresponding path program 1 times [2024-11-19 00:38:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:36,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456644611] [2024-11-19 00:38:36,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:36,034 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-19 00:38:36,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:36,035 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-19 00:38:36,036 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-19 00:38:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:36,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:38:36,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:38:36,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:36,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:36,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456644611] [2024-11-19 00:38:36,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456644611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:36,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:36,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:38:36,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090775254] [2024-11-19 00:38:36,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:36,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:38:36,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:36,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:38:36,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:36,510 INFO L87 Difference]: Start difference. First operand 289 states and 408 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:36,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:36,605 INFO L93 Difference]: Finished difference Result 581 states and 821 transitions. [2024-11-19 00:38:36,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:38:36,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-19 00:38:36,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:36,609 INFO L225 Difference]: With dead ends: 581 [2024-11-19 00:38:36,610 INFO L226 Difference]: Without dead ends: 295 [2024-11-19 00:38:36,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:36,611 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:36,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1104 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-19 00:38:36,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2024-11-19 00:38:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 252 states have (on average 1.3492063492063493) internal successors, (340), 253 states have internal predecessors, (340), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:38:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 412 transitions. [2024-11-19 00:38:36,632 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 412 transitions. Word has length 158 [2024-11-19 00:38:36,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:36,633 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 412 transitions. [2024-11-19 00:38:36,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 412 transitions. [2024-11-19 00:38:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 00:38:36,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:36,635 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:36,654 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-19 00:38:36,835 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-19 00:38:36,836 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:36,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash -388798779, now seen corresponding path program 1 times [2024-11-19 00:38:36,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:36,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008281712] [2024-11-19 00:38:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:36,837 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-19 00:38:36,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:36,838 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-19 00:38:36,839 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-19 00:38:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:37,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:38:37,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:38:37,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:37,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:37,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008281712] [2024-11-19 00:38:37,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008281712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:37,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:37,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:38:37,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937427215] [2024-11-19 00:38:37,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:37,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:38:37,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:37,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:38:37,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:38:37,327 INFO L87 Difference]: Start difference. First operand 293 states and 412 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:37,442 INFO L93 Difference]: Finished difference Result 589 states and 829 transitions. [2024-11-19 00:38:37,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:38:37,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-19 00:38:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:37,457 INFO L225 Difference]: With dead ends: 589 [2024-11-19 00:38:37,457 INFO L226 Difference]: Without dead ends: 299 [2024-11-19 00:38:37,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:38:37,458 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:37,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1280 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:38:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-19 00:38:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2024-11-19 00:38:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 256 states have (on average 1.34375) internal successors, (344), 257 states have internal predecessors, (344), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:38:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 416 transitions. [2024-11-19 00:38:37,474 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 416 transitions. Word has length 158 [2024-11-19 00:38:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:37,475 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 416 transitions. [2024-11-19 00:38:37,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:38:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 416 transitions. [2024-11-19 00:38:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 00:38:37,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:37,477 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:38:37,493 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-19 00:38:37,678 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-19 00:38:37,678 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:37,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:37,679 INFO L85 PathProgramCache]: Analyzing trace with hash -386951737, now seen corresponding path program 1 times [2024-11-19 00:38:37,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:37,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070499022] [2024-11-19 00:38:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:37,679 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-19 00:38:37,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:37,680 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-19 00:38:37,682 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