./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:56:29,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:56:29,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 12:56:30,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:56:30,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:56:30,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:56:30,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:56:30,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:56:30,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:56:30,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:56:30,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:56:30,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:56:30,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:56:30,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:56:30,049 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:56:30,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:56:30,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:56:30,050 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:56:30,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 12:56:30,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:56:30,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:56:30,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:56:30,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:56:30,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:56:30,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:56:30,053 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:56:30,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:56:30,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:56:30,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:56:30,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:56:30,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:56:30,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:56:30,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:56:30,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:56:30,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:56:30,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:56:30,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 12:56:30,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 12:56:30,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:56:30,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:56:30,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:56:30,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:56:30,057 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 -> 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d [2024-11-22 12:56:30,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:56:30,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:56:30,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:56:30,295 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:56:30,296 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:56:30,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2024-11-22 12:56:31,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:56:31,738 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:56:31,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2024-11-22 12:56:31,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/557eefd45/ddd05267a9be4cc5850688a9de710bdd/FLAG611e97909 [2024-11-22 12:56:32,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/557eefd45/ddd05267a9be4cc5850688a9de710bdd [2024-11-22 12:56:32,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:56:32,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:56:32,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:56:32,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:56:32,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:56:32,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:56:32" (1/1) ... [2024-11-22 12:56:32,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63751f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32, skipping insertion in model container [2024-11-22 12:56:32,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:56:32" (1/1) ... [2024-11-22 12:56:32,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:56:32,307 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-p_file-47.i[916,929] [2024-11-22 12:56:32,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:56:32,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:56:32,369 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-p_file-47.i[916,929] [2024-11-22 12:56:32,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:56:32,400 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:56:32,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32 WrapperNode [2024-11-22 12:56:32,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:56:32,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:56:32,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:56:32,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:56:32,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32" (1/1) ... [2024-11-22 12:56:32,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32" (1/1) ... [2024-11-22 12:56:32,443 INFO L138 Inliner]: procedures = 29, calls = 144, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-11-22 12:56:32,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:56:32,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:56:32,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:56:32,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:56:32,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32" (1/1) ... [2024-11-22 12:56:32,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32" (1/1) ... [2024-11-22 12:56:32,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32" (1/1) ... [2024-11-22 12:56:32,474 INFO L175 MemorySlicer]: Split 115 memory accesses to 10 slices as follows [2, 5, 16, 35, 12, 10, 14, 6, 8, 7]. 30 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 12 writes are split as follows [0, 2, 1, 2, 1, 1, 2, 1, 1, 1]. [2024-11-22 12:56:32,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32" (1/1) ... [2024-11-22 12:56:32,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32" (1/1) ... [2024-11-22 12:56:32,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32" (1/1) ... [2024-11-22 12:56:32,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32" (1/1) ... [2024-11-22 12:56:32,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32" (1/1) ... [2024-11-22 12:56:32,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32" (1/1) ... [2024-11-22 12:56:32,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:56:32,521 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:56:32,521 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:56:32,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:56:32,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32" (1/1) ... [2024-11-22 12:56:32,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:56:32,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:56:32,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 12:56:32,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 12:56:32,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:56:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-22 12:56:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-22 12:56:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-22 12:56:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-22 12:56:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-22 12:56:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-22 12:56:32,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-22 12:56:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-22 12:56:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-22 12:56:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-22 12:56:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 12:56:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 12:56:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 12:56:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 12:56:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 12:56:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-22 12:56:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-22 12:56:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-22 12:56:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 12:56:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 12:56:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 12:56:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-22 12:56:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-22 12:56:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-22 12:56:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-22 12:56:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-22 12:56:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-22 12:56:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-22 12:56:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-22 12:56:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-22 12:56:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-22 12:56:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-22 12:56:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-22 12:56:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-22 12:56:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-22 12:56:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-22 12:56:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:56:32,606 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:56:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 12:56:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 12:56:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 12:56:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 12:56:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 12:56:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-22 12:56:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-22 12:56:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-22 12:56:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-22 12:56:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-22 12:56:32,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:56:32,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:56:32,739 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:56:32,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:56:33,120 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2024-11-22 12:56:33,120 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:56:33,135 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:56:33,136 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:56:33,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:56:33 BoogieIcfgContainer [2024-11-22 12:56:33,136 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:56:33,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:56:33,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:56:33,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:56:33,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:56:32" (1/3) ... [2024-11-22 12:56:33,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223c800a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:56:33, skipping insertion in model container [2024-11-22 12:56:33,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:32" (2/3) ... [2024-11-22 12:56:33,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223c800a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:56:33, skipping insertion in model container [2024-11-22 12:56:33,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:56:33" (3/3) ... [2024-11-22 12:56:33,144 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-47.i [2024-11-22 12:56:33,159 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:56:33,159 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:56:33,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:56:33,223 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;@591e76e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:56:33,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:56:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:56:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:56:33,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:33,237 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:33,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:33,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash -766083450, now seen corresponding path program 1 times [2024-11-22 12:56:33,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:56:33,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236295383] [2024-11-22 12:56:33,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:33,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:56:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-22 12:56:33,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:56:33,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236295383] [2024-11-22 12:56:33,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236295383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:56:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101362895] [2024-11-22 12:56:33,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:33,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:56:33,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:56:33,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:56:33,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 12:56:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:33,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:56:33,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-22 12:56:33,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:56:33,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101362895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:56:33,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:56:33,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 12:56:33,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891852407] [2024-11-22 12:56:33,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:33,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:56:33,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:56:33,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:56:33,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:56:33,860 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:56:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:33,884 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-22 12:56:33,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:56:33,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-22 12:56:33,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:33,892 INFO L225 Difference]: With dead ends: 185 [2024-11-22 12:56:33,893 INFO L226 Difference]: Without dead ends: 92 [2024-11-22 12:56:33,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:56:33,899 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:33,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:56:33,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-22 12:56:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-22 12:56:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:56:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-22 12:56:33,939 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-22 12:56:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:33,940 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-22 12:56:33,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:56:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-22 12:56:33,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:56:33,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:33,943 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:33,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 12:56:34,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 12:56:34,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:34,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1428001612, now seen corresponding path program 1 times [2024-11-22 12:56:34,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:56:34,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804488784] [2024-11-22 12:56:34,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:34,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:56:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:56:34,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:56:34,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804488784] [2024-11-22 12:56:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804488784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:56:34,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:56:34,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:56:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031298733] [2024-11-22 12:56:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:34,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:56:34,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:56:34,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:56:34,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:56:34,306 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:34,334 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-22 12:56:34,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:56:34,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:56:34,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:34,338 INFO L225 Difference]: With dead ends: 182 [2024-11-22 12:56:34,338 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 12:56:34,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:56:34,340 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:34,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:56:34,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 12:56:34,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-22 12:56:34,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:56:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-22 12:56:34,353 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-22 12:56:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:34,355 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-22 12:56:34,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:34,359 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-22 12:56:34,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:56:34,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:34,361 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:34,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 12:56:34,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:34,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:34,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1178021942, now seen corresponding path program 1 times [2024-11-22 12:56:34,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:56:34,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095751525] [2024-11-22 12:56:34,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:34,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:56:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-22 12:56:34,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:56:34,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095751525] [2024-11-22 12:56:34,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095751525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:56:34,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556321550] [2024-11-22 12:56:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:34,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:56:34,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:56:34,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:56:34,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 12:56:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:34,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:56:34,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:56:34,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:56:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556321550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:56:34,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:56:34,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-22 12:56:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578267257] [2024-11-22 12:56:34,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:34,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:56:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:56:34,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:56:34,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:56:34,859 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:34,891 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-22 12:56:34,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:56:34,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:56:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:34,898 INFO L225 Difference]: With dead ends: 186 [2024-11-22 12:56:34,898 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 12:56:34,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:56:34,899 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:34,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:56:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 12:56:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-22 12:56:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:56:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-22 12:56:34,907 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 84 [2024-11-22 12:56:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:34,908 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-22 12:56:34,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-22 12:56:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:56:34,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:34,909 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:34,916 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-22 12:56:35,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-22 12:56:35,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:35,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:35,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1179868984, now seen corresponding path program 1 times [2024-11-22 12:56:35,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:56:35,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565900332] [2024-11-22 12:56:35,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:35,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:56:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-22 12:56:35,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:56:35,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565900332] [2024-11-22 12:56:35,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565900332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:56:35,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588922008] [2024-11-22 12:56:35,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:35,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:56:35,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:56:35,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:56:35,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 12:56:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:35,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:56:35,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:35,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-22 12:56:35,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-22 12:56:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:56:35,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:56:35,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588922008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:56:35,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:56:35,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-22 12:56:35,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609567731] [2024-11-22 12:56:35,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:35,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:56:35,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:56:35,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:56:35,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:56:35,562 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:35,778 INFO L93 Difference]: Finished difference Result 279 states and 405 transitions. [2024-11-22 12:56:35,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:56:35,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:56:35,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:35,783 INFO L225 Difference]: With dead ends: 279 [2024-11-22 12:56:35,783 INFO L226 Difference]: Without dead ends: 187 [2024-11-22 12:56:35,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:56:35,784 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 124 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:35,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 587 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:56:35,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-22 12:56:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2024-11-22 12:56:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 153 states have (on average 1.411764705882353) internal successors, (216), 153 states have internal predecessors, (216), 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-22 12:56:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 252 transitions. [2024-11-22 12:56:35,805 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 252 transitions. Word has length 84 [2024-11-22 12:56:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:35,806 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 252 transitions. [2024-11-22 12:56:35,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 252 transitions. [2024-11-22 12:56:35,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:56:35,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:35,807 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:35,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 12:56:36,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:56:36,008 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:36,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:36,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1603693142, now seen corresponding path program 1 times [2024-11-22 12:56:36,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:56:36,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436570832] [2024-11-22 12:56:36,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:36,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:56:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:56:36,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 12:56:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:56:36,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 12:56:36,173 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 12:56:36,173 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 12:56:36,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 12:56:36,178 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-22 12:56:36,276 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 12:56:36,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:56:36 BoogieIcfgContainer [2024-11-22 12:56:36,282 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 12:56:36,282 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 12:56:36,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 12:56:36,282 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 12:56:36,283 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:56:33" (3/4) ... [2024-11-22 12:56:36,285 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 12:56:36,285 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 12:56:36,286 INFO L158 Benchmark]: Toolchain (without parser) took 4143.75ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 120.9MB in the beginning and 85.2MB in the end (delta: 35.7MB). Peak memory consumption was 125.3MB. Max. memory is 16.1GB. [2024-11-22 12:56:36,286 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:56:36,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.73ms. Allocated memory is still 161.5MB. Free memory was 120.9MB in the beginning and 105.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 12:56:36,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.03ms. Allocated memory is still 161.5MB. Free memory was 105.7MB in the beginning and 102.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:56:36,287 INFO L158 Benchmark]: Boogie Preprocessor took 75.99ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 97.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:56:36,287 INFO L158 Benchmark]: RCFGBuilder took 615.49ms. Allocated memory is still 161.5MB. Free memory was 97.8MB in the beginning and 62.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-22 12:56:36,287 INFO L158 Benchmark]: TraceAbstraction took 3143.69ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 61.1MB in the beginning and 85.2MB in the end (delta: -24.1MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2024-11-22 12:56:36,287 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 249.6MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:56:36,288 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 161.5MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.73ms. Allocated memory is still 161.5MB. Free memory was 120.9MB in the beginning and 105.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.03ms. Allocated memory is still 161.5MB. Free memory was 105.7MB in the beginning and 102.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.99ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 97.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 615.49ms. Allocated memory is still 161.5MB. Free memory was 97.8MB in the beginning and 62.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3143.69ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 61.1MB in the beginning and 85.2MB in the end (delta: -24.1MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 249.6MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 24.575; [L22] double var_1_1 = 24.575; [L23] double* var_1_1_Pointer = &(var_1_1); [L24] double var_1_8 = 3.5; [L24] double var_1_8 = 3.5; [L25] double* var_1_8_Pointer = &(var_1_8); [L26] signed char var_1_9 = 16; [L26] signed char var_1_9 = 16; [L27] signed char* var_1_9_Pointer = &(var_1_9); [L28] signed char var_1_10 = 16; [L28] signed char var_1_10 = 16; [L29] signed char* var_1_10_Pointer = &(var_1_10); [L30] signed char var_1_11 = 4; [L30] signed char var_1_11 = 4; [L31] signed char* var_1_11_Pointer = &(var_1_11); [L32] signed long int var_1_12 = 8; [L32] signed long int var_1_12 = 8; [L33] signed long int* var_1_12_Pointer = &(var_1_12); [L34] unsigned char var_1_13 = 1; [L34] unsigned char var_1_13 = 1; [L35] unsigned char* var_1_13_Pointer = &(var_1_13); [L36] unsigned char var_1_14 = 1; [L36] unsigned char var_1_14 = 1; [L37] unsigned char* var_1_14_Pointer = &(var_1_14); [L38] double var_1_15 = 3.8; [L38] double var_1_15 = 3.8; [L39] double* var_1_15_Pointer = &(var_1_15); [L40] signed long int last_1_var_1_12 = 8; VAL [isInitial=0, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L87] EXPR \read(var_1_12) [L87] last_1_var_1_12 = var_1_12 [L97] RET updateLastVariables() [L98] CALL updateVariables() [L71] var_1_8 = __VERIFIER_nondet_double() [L72] EXPR \read(var_1_8) [L72] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F [L72] EXPR \read(var_1_8) [L72] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] EXPR (var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] EXPR (var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L73] var_1_10 = __VERIFIER_nondet_char() [L74] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L74] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L74] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L75] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L75] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L75] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L76] var_1_11 = __VERIFIER_nondet_char() [L77] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L77] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L77] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L79] var_1_13 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L82] var_1_14 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L83] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L83] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L98] RET updateVariables() [L99] CALL step() [L44] COND FALSE !(-4 > last_1_var_1_12) [L49] EXPR \read(*var_1_10_Pointer) [L49] (*(var_1_9_Pointer)) = (*(var_1_10_Pointer)) [L51] EXPR \read(*var_1_13_Pointer) [L51] unsigned char stepLocal_0 = ! (*(var_1_13_Pointer)); [L52] stepLocal_0 || (*(var_1_14_Pointer)) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L52] stepLocal_0 || (*(var_1_14_Pointer)) [L52] EXPR \read(*var_1_14_Pointer) [L52] stepLocal_0 || (*(var_1_14_Pointer)) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L52] COND FALSE !(stepLocal_0 || (*(var_1_14_Pointer))) [L59] EXPR \read(*var_1_8_Pointer) [L59] (*(var_1_15_Pointer)) = (*(var_1_8_Pointer)) [L60] EXPR \read(*var_1_15_Pointer) [L60] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L60] COND FALSE !((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) [L65] EXPR \read(*var_1_12_Pointer) [L65] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L65] COND TRUE (*(var_1_12_Pointer)) > (*(var_1_9_Pointer)) [L66] EXPR \read(*var_1_8_Pointer) [L66] (*(var_1_1_Pointer)) = (*(var_1_8_Pointer)) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR \read(*var_1_15_Pointer) [L90] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1 [L90] EXPR \read(*var_1_1_Pointer) [L90] EXPR \read(*var_1_8_Pointer) [L90] EXPR ((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1 VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((double) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((double) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90-L91] return (((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((double) (*(var_1_8_Pointer)))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 1365 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 791 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 574 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 581 ConstructedInterpolants, 0 QuantifiedInterpolants, 665 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1163 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 974/1008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 12:56:36,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:56:38,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:56:38,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 12:56:38,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:56:38,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:56:38,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:56:38,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:56:38,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:56:38,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:56:38,238 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:56:38,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:56:38,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:56:38,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:56:38,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:56:38,239 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:56:38,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:56:38,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:56:38,240 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:56:38,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:56:38,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:56:38,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:56:38,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:56:38,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:56:38,242 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 12:56:38,242 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 12:56:38,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:56:38,242 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 12:56:38,242 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:56:38,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:56:38,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:56:38,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:56:38,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:56:38,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:56:38,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:56:38,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:56:38,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:56:38,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:56:38,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:56:38,245 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 12:56:38,245 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 12:56:38,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:56:38,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:56:38,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:56:38,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:56:38,248 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 -> 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d [2024-11-22 12:56:38,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:56:38,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:56:38,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:56:38,516 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:56:38,516 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:56:38,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2024-11-22 12:56:39,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:56:40,017 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:56:40,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2024-11-22 12:56:40,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe5136dd/2e9e84ff01524520aabe1e29064d620b/FLAG249fe1b53 [2024-11-22 12:56:40,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe5136dd/2e9e84ff01524520aabe1e29064d620b [2024-11-22 12:56:40,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:56:40,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:56:40,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:56:40,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:56:40,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:56:40,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:56:40" (1/1) ... [2024-11-22 12:56:40,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a402b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40, skipping insertion in model container [2024-11-22 12:56:40,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:56:40" (1/1) ... [2024-11-22 12:56:40,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:56:40,234 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-p_file-47.i[916,929] [2024-11-22 12:56:40,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:56:40,307 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:56:40,317 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-p_file-47.i[916,929] [2024-11-22 12:56:40,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:56:40,353 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:56:40,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40 WrapperNode [2024-11-22 12:56:40,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:56:40,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:56:40,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:56:40,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:56:40,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40" (1/1) ... [2024-11-22 12:56:40,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40" (1/1) ... [2024-11-22 12:56:40,400 INFO L138 Inliner]: procedures = 33, calls = 144, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 474 [2024-11-22 12:56:40,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:56:40,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:56:40,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:56:40,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:56:40,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40" (1/1) ... [2024-11-22 12:56:40,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40" (1/1) ... [2024-11-22 12:56:40,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40" (1/1) ... [2024-11-22 12:56:40,439 INFO L175 MemorySlicer]: Split 115 memory accesses to 10 slices as follows [2, 5, 16, 35, 12, 10, 14, 6, 8, 7]. 30 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 12 writes are split as follows [0, 2, 1, 2, 1, 1, 2, 1, 1, 1]. [2024-11-22 12:56:40,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40" (1/1) ... [2024-11-22 12:56:40,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40" (1/1) ... [2024-11-22 12:56:40,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40" (1/1) ... [2024-11-22 12:56:40,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40" (1/1) ... [2024-11-22 12:56:40,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40" (1/1) ... [2024-11-22 12:56:40,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40" (1/1) ... [2024-11-22 12:56:40,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:56:40,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:56:40,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:56:40,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:56:40,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40" (1/1) ... [2024-11-22 12:56:40,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:56:40,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:56:40,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 12:56:40,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 12:56:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:56:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-22 12:56:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-22 12:56:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-22 12:56:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-22 12:56:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-22 12:56:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-22 12:56:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-22 12:56:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-22 12:56:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-22 12:56:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-22 12:56:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-22 12:56:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-22 12:56:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-22 12:56:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-22 12:56:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-22 12:56:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-22 12:56:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-22 12:56:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-22 12:56:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-22 12:56:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-22 12:56:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 12:56:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 12:56:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 12:56:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-22 12:56:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-22 12:56:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-22 12:56:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-22 12:56:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-22 12:56:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-22 12:56:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-22 12:56:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 12:56:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 12:56:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 12:56:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 12:56:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-22 12:56:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-22 12:56:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-22 12:56:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-22 12:56:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-22 12:56:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-22 12:56:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 12:56:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 12:56:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-22 12:56:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-22 12:56:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-22 12:56:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-22 12:56:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-22 12:56:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-22 12:56:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-22 12:56:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-22 12:56:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-22 12:56:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-22 12:56:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-22 12:56:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-22 12:56:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-22 12:56:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-22 12:56:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-22 12:56:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-22 12:56:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-22 12:56:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-22 12:56:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 12:56:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 12:56:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 12:56:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-22 12:56:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-22 12:56:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-22 12:56:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-22 12:56:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-22 12:56:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-22 12:56:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-22 12:56:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:56:40,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:56:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:56:40,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:56:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 12:56:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 12:56:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-22 12:56:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-22 12:56:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-22 12:56:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-22 12:56:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-22 12:56:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-22 12:56:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-22 12:56:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-22 12:56:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 12:56:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 12:56:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 12:56:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-22 12:56:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-22 12:56:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-22 12:56:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-22 12:56:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-22 12:56:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-22 12:56:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-22 12:56:40,734 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:56:40,736 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:56:41,213 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-11-22 12:56:41,213 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:56:41,226 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:56:41,226 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:56:41,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:56:41 BoogieIcfgContainer [2024-11-22 12:56:41,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:56:41,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:56:41,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:56:41,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:56:41,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:56:40" (1/3) ... [2024-11-22 12:56:41,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1275b080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:56:41, skipping insertion in model container [2024-11-22 12:56:41,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:56:40" (2/3) ... [2024-11-22 12:56:41,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1275b080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:56:41, skipping insertion in model container [2024-11-22 12:56:41,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:56:41" (3/3) ... [2024-11-22 12:56:41,233 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-47.i [2024-11-22 12:56:41,246 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:56:41,246 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:56:41,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:56:41,311 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;@408ce04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:56:41,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:56:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:56:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:56:41,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:41,325 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:41,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:41,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:41,331 INFO L85 PathProgramCache]: Analyzing trace with hash -766083450, now seen corresponding path program 1 times [2024-11-22 12:56:41,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:56:41,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750301732] [2024-11-22 12:56:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:41,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:41,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:56:41,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:56:41,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 12:56:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:41,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:56:41,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-22 12:56:41,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:56:41,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:56:41,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750301732] [2024-11-22 12:56:41,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750301732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:56:41,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:56:41,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 12:56:41,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318338267] [2024-11-22 12:56:41,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:41,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:56:41,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:56:41,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:56:41,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:56:41,674 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:56:41,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:41,692 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-22 12:56:41,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:56:41,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-22 12:56:41,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:41,699 INFO L225 Difference]: With dead ends: 185 [2024-11-22 12:56:41,700 INFO L226 Difference]: Without dead ends: 92 [2024-11-22 12:56:41,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:56:41,704 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:41,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:56:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-22 12:56:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-22 12:56:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:56:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-22 12:56:41,742 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-22 12:56:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:41,743 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-22 12:56:41,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:56:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-22 12:56:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:56:41,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:41,747 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:41,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 12:56:41,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:41,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:41,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:41,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1428001612, now seen corresponding path program 1 times [2024-11-22 12:56:41,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:56:41,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592844765] [2024-11-22 12:56:41,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:41,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:41,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:56:41,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:56:41,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 12:56:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:42,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 12:56:42,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:56:42,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:56:42,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:56:42,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592844765] [2024-11-22 12:56:42,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592844765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:56:42,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:56:42,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:56:42,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230796113] [2024-11-22 12:56:42,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:42,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:56:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:56:42,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:56:42,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:56:42,208 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:42,596 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-22 12:56:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:56:42,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:56:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:42,599 INFO L225 Difference]: With dead ends: 182 [2024-11-22 12:56:42,599 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 12:56:42,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:56:42,600 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:42,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 12:56:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 12:56:42,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-22 12:56:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:56:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-22 12:56:42,608 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-22 12:56:42,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:42,609 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-22 12:56:42,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-22 12:56:42,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:56:42,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:42,615 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:42,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 12:56:42,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:42,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:42,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1178021942, now seen corresponding path program 1 times [2024-11-22 12:56:42,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:56:42,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245027719] [2024-11-22 12:56:42,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:42,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:42,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:56:42,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:56:42,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 12:56:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:43,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:56:43,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:56:43,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:56:43,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:56:43,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245027719] [2024-11-22 12:56:43,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245027719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:56:43,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:56:43,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:56:43,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033322268] [2024-11-22 12:56:43,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:43,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:56:43,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:56:43,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:56:43,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:56:43,095 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:43,252 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-22 12:56:43,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:56:43,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:56:43,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:43,253 INFO L225 Difference]: With dead ends: 186 [2024-11-22 12:56:43,254 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 12:56:43,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:56:43,255 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:43,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:56:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 12:56:43,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-22 12:56:43,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:56:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-22 12:56:43,262 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2024-11-22 12:56:43,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:43,263 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-22 12:56:43,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-22 12:56:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:56:43,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:43,270 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:43,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 12:56:43,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:43,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:43,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1605540184, now seen corresponding path program 1 times [2024-11-22 12:56:43,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:56:43,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096476059] [2024-11-22 12:56:43,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:43,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:43,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:56:43,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:56:43,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 12:56:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:43,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:56:43,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:56:43,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:56:43,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:56:43,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096476059] [2024-11-22 12:56:43,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096476059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:56:43,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:56:43,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:56:43,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762089587] [2024-11-22 12:56:43,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:43,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:56:43,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:56:43,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:56:43,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:56:43,717 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:43,962 INFO L93 Difference]: Finished difference Result 194 states and 280 transitions. [2024-11-22 12:56:43,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:56:43,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:56:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:43,964 INFO L225 Difference]: With dead ends: 194 [2024-11-22 12:56:43,964 INFO L226 Difference]: Without dead ends: 101 [2024-11-22 12:56:43,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:56:43,965 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:43,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:56:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-22 12:56:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-22 12:56:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:56:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-22 12:56:43,978 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 84 [2024-11-22 12:56:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:43,978 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-22 12:56:43,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-22 12:56:43,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:56:43,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:43,983 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:43,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-22 12:56:44,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:44,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:44,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:44,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1603693142, now seen corresponding path program 1 times [2024-11-22 12:56:44,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:56:44,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266204925] [2024-11-22 12:56:44,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:44,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:44,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:56:44,188 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:56:44,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 12:56:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:44,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 12:56:44,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:45,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:56:45,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 62 [2024-11-22 12:56:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:56:45,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:56:45,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:56:45,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266204925] [2024-11-22 12:56:45,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266204925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:56:45,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:56:45,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:56:45,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802321561] [2024-11-22 12:56:45,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:45,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 12:56:45,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:56:45,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 12:56:45,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:56:45,206 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:46,071 INFO L93 Difference]: Finished difference Result 290 states and 413 transitions. [2024-11-22 12:56:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:56:46,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:56:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:46,073 INFO L225 Difference]: With dead ends: 290 [2024-11-22 12:56:46,073 INFO L226 Difference]: Without dead ends: 193 [2024-11-22 12:56:46,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:56:46,074 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 318 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:46,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 615 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 12:56:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-22 12:56:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 143. [2024-11-22 12:56:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 122 states have internal predecessors, (168), 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-22 12:56:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 204 transitions. [2024-11-22 12:56:46,094 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 204 transitions. Word has length 84 [2024-11-22 12:56:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:46,094 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 204 transitions. [2024-11-22 12:56:46,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2024-11-22 12:56:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:56:46,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:46,096 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:46,103 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-22 12:56:46,299 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-22 12:56:46,300 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:46,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:46,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1303975955, now seen corresponding path program 1 times [2024-11-22 12:56:46,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:56:46,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923373453] [2024-11-22 12:56:46,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:46,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:46,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:56:46,303 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-22 12:56:46,304 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-22 12:56:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:46,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-22 12:56:46,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:46,899 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 27 treesize of output 19 [2024-11-22 12:56:46,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 12:56:47,092 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 30 treesize of output 18 [2024-11-22 12:56:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:56:47,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:56:47,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:56:47,716 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 49 [2024-11-22 12:56:47,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:56:47,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923373453] [2024-11-22 12:56:47,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923373453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:56:47,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [510197373] [2024-11-22 12:56:47,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:47,917 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:56:47,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:56:47,920 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:56:47,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-22 12:56:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:48,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 12:56:48,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:48,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:56:48,557 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 178 treesize of output 58 [2024-11-22 12:56:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:56:48,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:56:48,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [510197373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:56:48,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:56:48,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-22 12:56:48,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998582801] [2024-11-22 12:56:48,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:48,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:56:48,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:56:48,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:56:48,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2024-11-22 12:56:48,646 INFO L87 Difference]: Start difference. First operand 143 states and 204 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:49,434 INFO L93 Difference]: Finished difference Result 415 states and 593 transitions. [2024-11-22 12:56:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:56:49,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:56:49,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:49,437 INFO L225 Difference]: With dead ends: 415 [2024-11-22 12:56:49,437 INFO L226 Difference]: Without dead ends: 275 [2024-11-22 12:56:49,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2024-11-22 12:56:49,440 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 123 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:49,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 482 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 12:56:49,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-22 12:56:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 145. [2024-11-22 12:56:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 124 states have (on average 1.3709677419354838) internal successors, (170), 124 states have internal predecessors, (170), 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-22 12:56:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 206 transitions. [2024-11-22 12:56:49,453 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 206 transitions. Word has length 84 [2024-11-22 12:56:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:49,453 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 206 transitions. [2024-11-22 12:56:49,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 206 transitions. [2024-11-22 12:56:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:56:49,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:49,460 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:49,469 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-22 12:56:49,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-22 12:56:49,861 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-22 12:56:49,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:49,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:49,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1363453396, now seen corresponding path program 1 times [2024-11-22 12:56:49,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:56:49,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429960783] [2024-11-22 12:56:49,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:49,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:49,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:56:49,864 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:56:49,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 12:56:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:50,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:56:50,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:56:50,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:56:50,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:56:50,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429960783] [2024-11-22 12:56:50,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429960783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:56:50,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:56:50,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:56:50,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898590745] [2024-11-22 12:56:50,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:50,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:56:50,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:56:50,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:56:50,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:56:50,045 INFO L87 Difference]: Start difference. First operand 145 states and 206 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:50,085 INFO L93 Difference]: Finished difference Result 287 states and 409 transitions. [2024-11-22 12:56:50,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:56:50,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:56:50,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:50,086 INFO L225 Difference]: With dead ends: 287 [2024-11-22 12:56:50,086 INFO L226 Difference]: Without dead ends: 145 [2024-11-22 12:56:50,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:56:50,088 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:50,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:56:50,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-22 12:56:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-22 12:56:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 124 states have internal predecessors, (169), 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-22 12:56:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-11-22 12:56:50,100 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 84 [2024-11-22 12:56:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:50,100 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-11-22 12:56:50,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-11-22 12:56:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 12:56:50,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:50,104 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:50,114 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-22 12:56:50,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:50,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:50,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:50,305 INFO L85 PathProgramCache]: Analyzing trace with hash -760820634, now seen corresponding path program 1 times [2024-11-22 12:56:50,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:56:50,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711953275] [2024-11-22 12:56:50,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:50,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:50,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:56:50,307 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:56:50,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 12:56:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:50,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 12:56:50,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:51,063 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 36 treesize of output 24 [2024-11-22 12:56:51,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 12:56:51,277 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 30 treesize of output 18 [2024-11-22 12:56:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 9 proven. 74 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-22 12:56:51,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:56:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:56:51,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:56:51,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711953275] [2024-11-22 12:56:51,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711953275] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:56:51,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:56:51,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-22 12:56:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825182440] [2024-11-22 12:56:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:51,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:56:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:56:51,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:56:51,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-22 12:56:51,484 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:51,770 INFO L93 Difference]: Finished difference Result 426 states and 605 transitions. [2024-11-22 12:56:51,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:56:51,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-11-22 12:56:51,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:51,772 INFO L225 Difference]: With dead ends: 426 [2024-11-22 12:56:51,772 INFO L226 Difference]: Without dead ends: 284 [2024-11-22 12:56:51,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-22 12:56:51,773 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 123 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:51,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 460 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:56:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-22 12:56:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2024-11-22 12:56:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 219 states have (on average 1.3470319634703196) internal successors, (295), 219 states have internal predecessors, (295), 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-22 12:56:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 367 transitions. [2024-11-22 12:56:51,788 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 367 transitions. Word has length 86 [2024-11-22 12:56:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:51,790 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 367 transitions. [2024-11-22 12:56:51,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:51,790 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 367 transitions. [2024-11-22 12:56:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 12:56:51,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:51,791 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:51,799 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 (10)] Ended with exit code 0 [2024-11-22 12:56:51,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:51,992 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:51,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:51,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1522767668, now seen corresponding path program 1 times [2024-11-22 12:56:51,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:56:51,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511002934] [2024-11-22 12:56:51,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:51,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:51,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:56:51,994 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:56:51,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 12:56:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:52,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 12:56:52,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:52,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-22 12:56:52,653 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 66 treesize of output 50 [2024-11-22 12:56:52,656 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 68 treesize of output 44 [2024-11-22 12:56:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:56:52,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:56:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:56:52,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:56:52,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511002934] [2024-11-22 12:56:52,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511002934] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:56:52,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:56:52,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 18 [2024-11-22 12:56:52,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741307287] [2024-11-22 12:56:52,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:52,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 12:56:52,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:56:52,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 12:56:52,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-22 12:56:52,896 INFO L87 Difference]: Start difference. First operand 260 states and 367 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:53,418 INFO L93 Difference]: Finished difference Result 754 states and 1048 transitions. [2024-11-22 12:56:53,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:56:53,421 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-11-22 12:56:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:53,423 INFO L225 Difference]: With dead ends: 754 [2024-11-22 12:56:53,423 INFO L226 Difference]: Without dead ends: 497 [2024-11-22 12:56:53,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-22 12:56:53,424 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 174 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:53,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 803 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 12:56:53,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-22 12:56:53,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 439. [2024-11-22 12:56:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 390 states have (on average 1.3615384615384616) internal successors, (531), 394 states have internal predecessors, (531), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:56:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 611 transitions. [2024-11-22 12:56:53,448 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 611 transitions. Word has length 86 [2024-11-22 12:56:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:53,448 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 611 transitions. [2024-11-22 12:56:53,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 611 transitions. [2024-11-22 12:56:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 12:56:53,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:53,449 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:53,456 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 (11)] Forceful destruction successful, exit code 0 [2024-11-22 12:56:53,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:53,650 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:53,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:53,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1963105168, now seen corresponding path program 1 times [2024-11-22 12:56:53,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:56:53,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132264977] [2024-11-22 12:56:53,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:53,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-22 12:56:53,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:56:53,652 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:56:53,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 12:56:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:53,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 12:56:53,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:54,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:56:54,357 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 150 treesize of output 60 [2024-11-22 12:56:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-22 12:56:54,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:56:54,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:56:54,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132264977] [2024-11-22 12:56:54,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132264977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:56:54,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1479150774] [2024-11-22 12:56:54,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:54,560 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:56:54,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:56:54,561 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:56:54,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-22 12:56:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:55,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-22 12:56:55,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:55,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-22 12:56:56,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-22 12:56:56,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 60 [2024-11-22 12:56:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-22 12:56:56,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:56:57,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1479150774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:56:57,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:56:57,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-22 12:56:57,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311410518] [2024-11-22 12:56:57,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:56:57,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 12:56:57,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:56:57,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 12:56:57,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2024-11-22 12:56:57,325 INFO L87 Difference]: Start difference. First operand 439 states and 611 transitions. Second operand has 20 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-22 12:56:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:58,626 INFO L93 Difference]: Finished difference Result 1178 states and 1630 transitions. [2024-11-22 12:56:58,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 12:56:58,628 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 86 [2024-11-22 12:56:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:58,633 INFO L225 Difference]: With dead ends: 1178 [2024-11-22 12:56:58,633 INFO L226 Difference]: Without dead ends: 742 [2024-11-22 12:56:58,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=237, Invalid=1095, Unknown=0, NotChecked=0, Total=1332 [2024-11-22 12:56:58,635 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 299 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:58,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1365 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 12:56:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-11-22 12:56:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 491. [2024-11-22 12:56:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 420 states have (on average 1.3357142857142856) internal successors, (561), 426 states have internal predecessors, (561), 58 states have call successors, (58), 12 states have call predecessors, (58), 12 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-22 12:56:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 677 transitions. [2024-11-22 12:56:58,679 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 677 transitions. Word has length 86 [2024-11-22 12:56:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:58,680 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 677 transitions. [2024-11-22 12:56:58,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-22 12:56:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 677 transitions. [2024-11-22 12:56:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 12:56:58,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:58,681 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:58,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-22 12:56:58,889 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 (12)] Forceful destruction successful, exit code 0 [2024-11-22 12:56:59,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:59,082 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:59,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:59,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1124071506, now seen corresponding path program 1 times [2024-11-22 12:56:59,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:56:59,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807091718] [2024-11-22 12:56:59,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:59,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:59,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:56:59,086 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:56:59,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-22 12:56:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:59,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 12:56:59,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-22 12:56:59,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:56:59,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:56:59,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807091718] [2024-11-22 12:56:59,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807091718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:56:59,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:56:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:56:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102801111] [2024-11-22 12:56:59,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:59,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:56:59,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:56:59,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:56:59,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:56:59,288 INFO L87 Difference]: Start difference. First operand 491 states and 677 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:56:59,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:59,377 INFO L93 Difference]: Finished difference Result 886 states and 1204 transitions. [2024-11-22 12:56:59,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:56:59,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2024-11-22 12:56:59,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:59,381 INFO L225 Difference]: With dead ends: 886 [2024-11-22 12:56:59,381 INFO L226 Difference]: Without dead ends: 374 [2024-11-22 12:56:59,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:56:59,383 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:59,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 553 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:56:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-22 12:56:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 360. [2024-11-22 12:56:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 313 states have (on average 1.31629392971246) internal successors, (412), 317 states have internal predecessors, (412), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-22 12:56:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 488 transitions. [2024-11-22 12:56:59,415 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 488 transitions. Word has length 86 [2024-11-22 12:56:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:59,415 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 488 transitions. [2024-11-22 12:56:59,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:56:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 488 transitions. [2024-11-22 12:56:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 12:56:59,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:59,417 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:56:59,424 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 (14)] Forceful destruction successful, exit code 0 [2024-11-22 12:56:59,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:59,617 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:59,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:59,618 INFO L85 PathProgramCache]: Analyzing trace with hash -513934107, now seen corresponding path program 1 times [2024-11-22 12:56:59,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:56:59,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402434695] [2024-11-22 12:56:59,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:59,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:56:59,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:56:59,620 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:56:59,621 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 (15)] Waiting until timeout for monitored process [2024-11-22 12:56:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:59,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:56:59,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:56:59,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:56:59,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:56:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402434695] [2024-11-22 12:56:59,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402434695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:56:59,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:56:59,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:56:59,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341365658] [2024-11-22 12:56:59,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:59,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:56:59,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:56:59,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:56:59,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:56:59,855 INFO L87 Difference]: Start difference. First operand 360 states and 488 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:56:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:59,992 INFO L93 Difference]: Finished difference Result 999 states and 1344 transitions. [2024-11-22 12:56:59,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:56:59,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2024-11-22 12:56:59,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:59,997 INFO L225 Difference]: With dead ends: 999 [2024-11-22 12:56:59,997 INFO L226 Difference]: Without dead ends: 642 [2024-11-22 12:56:59,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:56:59,999 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 217 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:59,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 346 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:57:00,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-22 12:57:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 478. [2024-11-22 12:57:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 420 states have (on average 1.3023809523809524) internal successors, (547), 424 states have internal predecessors, (547), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-22 12:57:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 641 transitions. [2024-11-22 12:57:00,041 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 641 transitions. Word has length 87 [2024-11-22 12:57:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:57:00,041 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 641 transitions. [2024-11-22 12:57:00,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:57:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 641 transitions. [2024-11-22 12:57:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 12:57:00,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:57:00,042 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:57:00,050 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 (15)] Ended with exit code 0 [2024-11-22 12:57:00,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:00,243 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:57:00,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:57:00,244 INFO L85 PathProgramCache]: Analyzing trace with hash 561473697, now seen corresponding path program 1 times [2024-11-22 12:57:00,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:57:00,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493153063] [2024-11-22 12:57:00,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:57:00,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:00,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:57:00,247 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:57:00,248 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 (16)] Waiting until timeout for monitored process [2024-11-22 12:57:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:57:00,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-22 12:57:00,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:57:01,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-22 12:57:01,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:57:01,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 24 [2024-11-22 12:57:01,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:57:01,912 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 199 treesize of output 79 [2024-11-22 12:57:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:57:02,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:57:02,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:57:02,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493153063] [2024-11-22 12:57:02,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493153063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:57:02,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:57:02,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 12:57:02,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925806906] [2024-11-22 12:57:02,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:57:02,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 12:57:02,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:57:02,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 12:57:02,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-22 12:57:02,166 INFO L87 Difference]: Start difference. First operand 478 states and 641 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:57:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:57:04,912 INFO L93 Difference]: Finished difference Result 1384 states and 1859 transitions. [2024-11-22 12:57:04,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 12:57:04,913 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2024-11-22 12:57:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:57:04,916 INFO L225 Difference]: With dead ends: 1384 [2024-11-22 12:57:04,916 INFO L226 Difference]: Without dead ends: 909 [2024-11-22 12:57:04,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2024-11-22 12:57:04,917 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 381 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:57:04,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1560 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 12:57:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-22 12:57:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 609. [2024-11-22 12:57:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 540 states have (on average 1.3166666666666667) internal successors, (711), 542 states have internal predecessors, (711), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-22 12:57:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 823 transitions. [2024-11-22 12:57:04,964 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 823 transitions. Word has length 88 [2024-11-22 12:57:04,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:57:04,965 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 823 transitions. [2024-11-22 12:57:04,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:57:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 823 transitions. [2024-11-22 12:57:04,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 12:57:04,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:57:04,966 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:57:04,974 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 (16)] Ended with exit code 0 [2024-11-22 12:57:05,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:05,167 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:57:05,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:57:05,167 INFO L85 PathProgramCache]: Analyzing trace with hash -25332317, now seen corresponding path program 1 times [2024-11-22 12:57:05,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:57:05,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397124586] [2024-11-22 12:57:05,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:57:05,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:05,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:57:05,169 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:57:05,169 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 (17)] Waiting until timeout for monitored process [2024-11-22 12:57:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:57:05,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 12:57:05,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:57:05,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:57:05,911 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 96 treesize of output 36 [2024-11-22 12:57:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:57:05,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:57:05,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:57:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397124586] [2024-11-22 12:57:05,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397124586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:57:05,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:57:05,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:57:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18872393] [2024-11-22 12:57:05,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:57:05,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 12:57:05,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:57:05,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 12:57:05,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:57:05,945 INFO L87 Difference]: Start difference. First operand 609 states and 823 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:57:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:57:06,574 INFO L93 Difference]: Finished difference Result 1407 states and 1896 transitions. [2024-11-22 12:57:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:57:06,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2024-11-22 12:57:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:57:06,578 INFO L225 Difference]: With dead ends: 1407 [2024-11-22 12:57:06,578 INFO L226 Difference]: Without dead ends: 801 [2024-11-22 12:57:06,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-22 12:57:06,579 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 286 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:57:06,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 567 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 12:57:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-22 12:57:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 609. [2024-11-22 12:57:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 540 states have (on average 1.3074074074074074) internal successors, (706), 542 states have internal predecessors, (706), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-22 12:57:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 818 transitions. [2024-11-22 12:57:06,615 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 818 transitions. Word has length 88 [2024-11-22 12:57:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:57:06,616 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 818 transitions. [2024-11-22 12:57:06,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:57:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 818 transitions. [2024-11-22 12:57:06,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 12:57:06,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:57:06,617 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:57:06,625 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 (17)] Ended with exit code 0 [2024-11-22 12:57:06,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:06,818 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:57:06,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:57:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1436083919, now seen corresponding path program 1 times [2024-11-22 12:57:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:57:06,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886309303] [2024-11-22 12:57:06,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:57:06,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:06,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:57:06,819 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:57:06,820 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 (18)] Waiting until timeout for monitored process [2024-11-22 12:57:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:57:06,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 12:57:06,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:57:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:57:07,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:57:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:57:07,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:57:07,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886309303] [2024-11-22 12:57:07,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886309303] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:57:07,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:57:07,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-22 12:57:07,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795463563] [2024-11-22 12:57:07,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:57:07,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:57:07,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:57:07,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:57:07,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:57:07,308 INFO L87 Difference]: Start difference. First operand 609 states and 818 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:57:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:57:07,383 INFO L93 Difference]: Finished difference Result 1622 states and 2170 transitions. [2024-11-22 12:57:07,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:57:07,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-22 12:57:07,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:57:07,386 INFO L225 Difference]: With dead ends: 1622 [2024-11-22 12:57:07,386 INFO L226 Difference]: Without dead ends: 1016 [2024-11-22 12:57:07,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:57:07,388 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 88 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:57:07,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 490 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:57:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-11-22 12:57:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1010. [2024-11-22 12:57:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 909 states have (on average 1.308030803080308) internal successors, (1189), 917 states have internal predecessors, (1189), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-22 12:57:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1345 transitions. [2024-11-22 12:57:07,439 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1345 transitions. Word has length 89 [2024-11-22 12:57:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:57:07,439 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1345 transitions. [2024-11-22 12:57:07,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:57:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1345 transitions. [2024-11-22 12:57:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 12:57:07,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:57:07,441 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:57:07,448 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 (18)] Forceful destruction successful, exit code 0 [2024-11-22 12:57:07,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:07,642 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:57:07,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:57:07,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2116142289, now seen corresponding path program 1 times [2024-11-22 12:57:07,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:57:07,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210258144] [2024-11-22 12:57:07,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:57:07,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:07,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:57:07,643 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:57:07,644 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 (19)] Waiting until timeout for monitored process [2024-11-22 12:57:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:57:07,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 12:57:07,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:57:08,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-22 12:57:08,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:57:08,930 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 245 treesize of output 145 [2024-11-22 12:57:08,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:57:08,940 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 285 treesize of output 135 [2024-11-22 12:57:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:57:09,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:57:09,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:57:09,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210258144] [2024-11-22 12:57:09,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210258144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:57:09,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:57:09,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 12:57:09,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94046341] [2024-11-22 12:57:09,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:57:09,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 12:57:09,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:57:09,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 12:57:09,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:57:09,031 INFO L87 Difference]: Start difference. First operand 1010 states and 1345 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:57:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:57:14,692 INFO L93 Difference]: Finished difference Result 1390 states and 1842 transitions. [2024-11-22 12:57:14,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 12:57:14,693 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-22 12:57:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:57:14,697 INFO L225 Difference]: With dead ends: 1390 [2024-11-22 12:57:14,697 INFO L226 Difference]: Without dead ends: 1388 [2024-11-22 12:57:14,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=81, Invalid=338, Unknown=1, NotChecked=0, Total=420 [2024-11-22 12:57:14,698 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 282 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 12:57:14,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 912 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 12:57:14,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-22 12:57:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1316. [2024-11-22 12:57:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1215 states have (on average 1.3135802469135802) internal successors, (1596), 1223 states have internal predecessors, (1596), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-22 12:57:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1752 transitions. [2024-11-22 12:57:14,761 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1752 transitions. Word has length 89 [2024-11-22 12:57:14,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:57:14,761 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1752 transitions. [2024-11-22 12:57:14,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:57:14,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1752 transitions. [2024-11-22 12:57:14,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 12:57:14,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:57:14,763 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:57:14,771 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 (19)] Forceful destruction successful, exit code 0 [2024-11-22 12:57:14,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:14,963 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:57:14,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:57:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2117989331, now seen corresponding path program 1 times [2024-11-22 12:57:14,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:57:14,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498282494] [2024-11-22 12:57:14,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:57:14,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:14,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:57:14,965 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:57:14,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-22 12:57:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:57:15,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:57:15,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:57:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:57:15,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:57:15,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:57:15,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498282494] [2024-11-22 12:57:15,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498282494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:57:15,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:57:15,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:57:15,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379034142] [2024-11-22 12:57:15,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:57:15,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:57:15,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:57:15,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:57:15,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:57:15,160 INFO L87 Difference]: Start difference. First operand 1316 states and 1752 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:57:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:57:15,291 INFO L93 Difference]: Finished difference Result 2683 states and 3573 transitions. [2024-11-22 12:57:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:57:15,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-22 12:57:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:57:15,295 INFO L225 Difference]: With dead ends: 2683 [2024-11-22 12:57:15,295 INFO L226 Difference]: Without dead ends: 1370 [2024-11-22 12:57:15,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:57:15,298 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:57:15,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 477 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:57:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2024-11-22 12:57:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1370. [2024-11-22 12:57:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1269 states have (on average 1.3002364066193854) internal successors, (1650), 1277 states have internal predecessors, (1650), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-22 12:57:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1806 transitions. [2024-11-22 12:57:15,354 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1806 transitions. Word has length 89 [2024-11-22 12:57:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:57:15,355 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1806 transitions. [2024-11-22 12:57:15,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:57:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1806 transitions. [2024-11-22 12:57:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-22 12:57:15,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:57:15,356 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:57:15,363 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 (20)] Ended with exit code 0 [2024-11-22 12:57:15,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:15,557 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:57:15,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:57:15,557 INFO L85 PathProgramCache]: Analyzing trace with hash -329620377, now seen corresponding path program 1 times [2024-11-22 12:57:15,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:57:15,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278285133] [2024-11-22 12:57:15,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:57:15,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:15,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:57:15,560 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:57:15,561 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 (21)] Waiting until timeout for monitored process [2024-11-22 12:57:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:57:15,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 12:57:15,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:57:16,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:57:16,902 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 144 treesize of output 54 [2024-11-22 12:57:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-22 12:57:16,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:57:17,520 INFO L349 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2024-11-22 12:57:17,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 92 [2024-11-22 12:57:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-22 12:57:24,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:57:24,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278285133] [2024-11-22 12:57:24,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278285133] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:57:24,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:57:24,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-22 12:57:24,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897291269] [2024-11-22 12:57:24,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:57:24,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 12:57:24,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:57:24,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 12:57:24,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=276, Unknown=1, NotChecked=0, Total=342 [2024-11-22 12:57:24,411 INFO L87 Difference]: Start difference. First operand 1370 states and 1806 transitions. Second operand has 19 states, 17 states have (on average 5.0) internal successors, (85), 18 states have internal predecessors, (85), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-22 12:57:29,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:57:33,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:57:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:57:33,988 INFO L93 Difference]: Finished difference Result 2815 states and 3695 transitions. [2024-11-22 12:57:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 12:57:33,989 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.0) internal successors, (85), 18 states have internal predecessors, (85), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 90 [2024-11-22 12:57:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:57:33,993 INFO L225 Difference]: With dead ends: 2815 [2024-11-22 12:57:33,994 INFO L226 Difference]: Without dead ends: 1448 [2024-11-22 12:57:33,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=212, Invalid=717, Unknown=1, NotChecked=0, Total=930 [2024-11-22 12:57:33,996 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 465 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 44 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-22 12:57:33,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1530 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 511 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-11-22 12:57:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2024-11-22 12:57:34,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1370. [2024-11-22 12:57:34,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1269 states have (on average 1.2923561859732073) internal successors, (1640), 1277 states have internal predecessors, (1640), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-22 12:57:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1796 transitions. [2024-11-22 12:57:34,065 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1796 transitions. Word has length 90 [2024-11-22 12:57:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:57:34,065 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1796 transitions. [2024-11-22 12:57:34,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.0) internal successors, (85), 18 states have internal predecessors, (85), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-22 12:57:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1796 transitions. [2024-11-22 12:57:34,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-22 12:57:34,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:57:34,066 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:57:34,075 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 (21)] Forceful destruction successful, exit code 0 [2024-11-22 12:57:34,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:34,271 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:57:34,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:57:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1971202213, now seen corresponding path program 1 times [2024-11-22 12:57:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:57:34,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379037498] [2024-11-22 12:57:34,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:57:34,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:34,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:57:34,272 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:57:34,273 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 (22)] Waiting until timeout for monitored process [2024-11-22 12:57:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:57:34,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 12:57:34,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:57:35,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:57:35,830 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 144 treesize of output 54 [2024-11-22 12:57:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-22 12:57:35,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:57:36,562 INFO L349 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2024-11-22 12:57:36,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 92 [2024-11-22 12:57:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-22 12:57:43,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:57:43,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379037498] [2024-11-22 12:57:43,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379037498] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:57:43,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:57:43,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-22 12:57:43,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006812883] [2024-11-22 12:57:43,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:57:43,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 12:57:43,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:57:43,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 12:57:43,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=276, Unknown=1, NotChecked=0, Total=342 [2024-11-22 12:57:43,460 INFO L87 Difference]: Start difference. First operand 1370 states and 1796 transitions. Second operand has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 18 states have internal predecessors, (90), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-22 12:57:48,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:57:52,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:57:53,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:57:53,072 INFO L93 Difference]: Finished difference Result 2815 states and 3675 transitions. [2024-11-22 12:57:53,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 12:57:53,073 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 18 states have internal predecessors, (90), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 90 [2024-11-22 12:57:53,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:57:53,077 INFO L225 Difference]: With dead ends: 2815 [2024-11-22 12:57:53,077 INFO L226 Difference]: Without dead ends: 1448 [2024-11-22 12:57:53,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=212, Invalid=717, Unknown=1, NotChecked=0, Total=930 [2024-11-22 12:57:53,080 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 602 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 44 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:57:53,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1788 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 587 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2024-11-22 12:57:53,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2024-11-22 12:57:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1370. [2024-11-22 12:57:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1269 states have (on average 1.285263987391647) internal successors, (1631), 1277 states have internal predecessors, (1631), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-22 12:57:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1787 transitions. [2024-11-22 12:57:53,148 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1787 transitions. Word has length 90 [2024-11-22 12:57:53,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:57:53,148 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1787 transitions. [2024-11-22 12:57:53,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 18 states have internal predecessors, (90), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-22 12:57:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1787 transitions. [2024-11-22 12:57:53,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-22 12:57:53,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:57:53,150 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:57:53,159 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 (22)] Forceful destruction successful, exit code 0 [2024-11-22 12:57:53,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:53,351 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:57:53,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:57:53,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1384396199, now seen corresponding path program 1 times [2024-11-22 12:57:53,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:57:53,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719910613] [2024-11-22 12:57:53,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:57:53,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:57:53,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:57:53,352 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:57:53,353 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 (23)] Waiting until timeout for monitored process [2024-11-22 12:57:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:57:53,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 12:57:53,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:57:54,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-22 12:57:55,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:57:55,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 24 [2024-11-22 12:57:55,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:57:55,178 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 195 treesize of output 75 [2024-11-22 12:57:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-22 12:57:55,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:57:56,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:57:56,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719910613] [2024-11-22 12:57:56,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719910613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:57:56,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [56030468] [2024-11-22 12:57:56,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:57:56,215 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:57:56,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:57:56,217 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:57:56,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-22 12:57:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:57:57,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-22 12:57:57,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:57:57,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-22 12:58:02,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-22 12:58:03,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:58:03,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 24 [2024-11-22 12:58:03,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 83 [2024-11-22 12:58:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-22 12:58:07,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:58:07,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [56030468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:58:07,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:58:07,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2024-11-22 12:58:07,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732199223] [2024-11-22 12:58:07,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:58:07,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-22 12:58:07,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:58:07,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-22 12:58:07,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1322, Unknown=2, NotChecked=0, Total=1482 [2024-11-22 12:58:07,840 INFO L87 Difference]: Start difference. First operand 1370 states and 1787 transitions. Second operand has 31 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 28 states have internal predecessors, (91), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18)