./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.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 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:37:53,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:37:53,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:37:53,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:37:53,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:37:53,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:37:53,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:37:53,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:37:53,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:37:53,315 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:37:53,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:37:53,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:37:53,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:37:53,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:37:53,317 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:37:53,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:37:53,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:37:53,317 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:37:53,318 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:37:53,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:37:53,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:37:53,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:37:53,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:37:53,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:37:53,321 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:37:53,322 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:37:53,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:37:53,322 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:37:53,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:37:53,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:37:53,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:37:53,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:37:53,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:37:53,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:37:53,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:37:53,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:37:53,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:37:53,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:37:53,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:37:53,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:37:53,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:37:53,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:37:53,326 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 -> 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 [2024-11-19 00:37:53,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:37:53,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:37:53,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:37:53,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:37:53,536 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:37:53,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2024-11-19 00:37:54,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:37:54,938 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:37:54,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2024-11-19 00:37:54,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1565226af/3edfe7390c2c4a7eb7f38afac14da846/FLAG136e84d94 [2024-11-19 00:37:55,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1565226af/3edfe7390c2c4a7eb7f38afac14da846 [2024-11-19 00:37:55,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:37:55,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:37:55,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:37:55,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:37:55,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:37:55,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:37:55" (1/1) ... [2024-11-19 00:37:55,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fdbc3ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55, skipping insertion in model container [2024-11-19 00:37:55,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:37:55" (1/1) ... [2024-11-19 00:37:55,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:37:55,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i[916,929] [2024-11-19 00:37:55,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:37:55,583 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:37:55,593 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i[916,929] [2024-11-19 00:37:55,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:37:55,651 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:37:55,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55 WrapperNode [2024-11-19 00:37:55,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:37:55,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:37:55,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:37:55,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:37:55,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55" (1/1) ... [2024-11-19 00:37:55,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55" (1/1) ... [2024-11-19 00:37:55,711 INFO L138 Inliner]: procedures = 29, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 490 [2024-11-19 00:37:55,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:37:55,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:37:55,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:37:55,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:37:55,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55" (1/1) ... [2024-11-19 00:37:55,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55" (1/1) ... [2024-11-19 00:37:55,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55" (1/1) ... [2024-11-19 00:37:55,750 INFO L175 MemorySlicer]: Split 123 memory accesses to 7 slices as follows [2, 8, 44, 29, 9, 3, 28]. 36 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 2, 1, 3]. The 16 writes are split as follows [0, 1, 6, 3, 2, 1, 3]. [2024-11-19 00:37:55,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55" (1/1) ... [2024-11-19 00:37:55,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55" (1/1) ... [2024-11-19 00:37:55,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55" (1/1) ... [2024-11-19 00:37:55,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55" (1/1) ... [2024-11-19 00:37:55,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55" (1/1) ... [2024-11-19 00:37:55,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55" (1/1) ... [2024-11-19 00:37:55,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:37:55,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:37:55,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:37:55,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:37:55,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55" (1/1) ... [2024-11-19 00:37:55,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:37:55,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:55,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:37:55,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:37:55,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:37:55,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:37:55,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:37:55,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:37:55,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:37:55,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:37:55,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:37:55,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 00:37:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:37:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:37:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:37:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:37:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:37:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:37:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-19 00:37:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:37:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:37:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:37:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:37:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:37:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:37:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-19 00:37:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:37:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:37:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:37:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:37:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:37:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:37:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 00:37:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:37:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:37:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:37:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:37:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:37:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:37:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-19 00:37:55,865 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:37:55,865 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:37:55,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:37:55,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:37:55,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:37:55,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:37:55,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:37:55,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:37:55,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 00:37:55,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:37:55,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:37:56,006 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:37:56,008 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:37:56,421 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-19 00:37:56,421 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:37:56,434 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:37:56,436 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:37:56,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:37:56 BoogieIcfgContainer [2024-11-19 00:37:56,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:37:56,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:37:56,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:37:56,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:37:56,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:37:55" (1/3) ... [2024-11-19 00:37:56,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ac8f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:37:56, skipping insertion in model container [2024-11-19 00:37:56,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:55" (2/3) ... [2024-11-19 00:37:56,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ac8f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:37:56, skipping insertion in model container [2024-11-19 00:37:56,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:37:56" (3/3) ... [2024-11-19 00:37:56,447 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-65.i [2024-11-19 00:37:56,458 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:37:56,458 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:37:56,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:37:56,508 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;@2513ae46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:37:56,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:37:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:37:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:37:56,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:56,520 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:37:56,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:56,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:56,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1938011596, now seen corresponding path program 1 times [2024-11-19 00:37:56,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:56,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727061262] [2024-11-19 00:37:56,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:56,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-19 00:37:56,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:56,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727061262] [2024-11-19 00:37:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727061262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:56,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717865185] [2024-11-19 00:37:56,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:56,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:56,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:56,796 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:37:56,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:37:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:56,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:37:57,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-19 00:37:57,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:57,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717865185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:57,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:57,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:37:57,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097936490] [2024-11-19 00:37:57,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:57,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:37:57,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:57,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:37:57,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:37:57,053 INFO L87 Difference]: Start difference. First operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:37:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:57,080 INFO L93 Difference]: Finished difference Result 219 states and 337 transitions. [2024-11-19 00:37:57,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:37:57,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-19 00:37:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:57,090 INFO L225 Difference]: With dead ends: 219 [2024-11-19 00:37:57,091 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 00:37:57,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:37:57,098 INFO L432 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:57,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:57,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 00:37:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-19 00:37:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:37:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-19 00:37:57,137 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 112 [2024-11-19 00:37:57,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:57,138 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-19 00:37:57,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:37:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-19 00:37:57,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:37:57,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:57,142 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:37:57,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:37:57,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:37:57,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:57,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:57,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1962849030, now seen corresponding path program 1 times [2024-11-19 00:37:57,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:57,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970538923] [2024-11-19 00:37:57,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:57,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:37:57,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:57,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970538923] [2024-11-19 00:37:57,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970538923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:57,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:57,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:37:57,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944853237] [2024-11-19 00:37:57,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:57,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:37:57,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:57,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:37:57,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:37:57,544 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:37:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:57,580 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2024-11-19 00:37:57,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:37:57,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-19 00:37:57,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:57,582 INFO L225 Difference]: With dead ends: 217 [2024-11-19 00:37:57,583 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 00:37:57,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:37:57,585 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:57,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:57,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 00:37:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-19 00:37:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:37:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-19 00:37:57,598 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 112 [2024-11-19 00:37:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:57,599 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-19 00:37:57,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:37:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-19 00:37:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:37:57,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:57,600 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:37:57,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:37:57,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:57,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash 611463812, now seen corresponding path program 1 times [2024-11-19 00:37:57,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:57,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858378074] [2024-11-19 00:37:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:57,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:37:57,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:57,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858378074] [2024-11-19 00:37:57,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858378074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:57,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885366709] [2024-11-19 00:37:57,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:57,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:57,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:57,877 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:37:57,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:37:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:58,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:37:58,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:37:58,083 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:58,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885366709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:58,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:58,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-19 00:37:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49344489] [2024-11-19 00:37:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:58,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:37:58,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:58,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:37:58,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:37:58,086 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:37:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:58,119 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-19 00:37:58,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:37:58,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-19 00:37:58,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:58,122 INFO L225 Difference]: With dead ends: 222 [2024-11-19 00:37:58,122 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 00:37:58,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 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-19 00:37:58,126 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:58,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 00:37:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-19 00:37:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:37:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-19 00:37:58,136 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 112 [2024-11-19 00:37:58,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:58,137 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-19 00:37:58,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:37:58,138 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-19 00:37:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:37:58,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:58,141 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:37:58,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 00:37:58,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-19 00:37:58,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:58,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:58,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1291522182, now seen corresponding path program 1 times [2024-11-19 00:37:58,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:58,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761857749] [2024-11-19 00:37:58,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:58,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:37:58,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:58,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761857749] [2024-11-19 00:37:58,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761857749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:58,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797745570] [2024-11-19 00:37:58,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:58,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:58,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:58,483 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:37:58,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:37:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:58,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:37:58,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:37:58,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:58,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797745570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:58,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:58,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-19 00:37:58,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624922040] [2024-11-19 00:37:58,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:58,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:37:58,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:58,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:37:58,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:37:58,691 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:37:58,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:58,712 INFO L93 Difference]: Finished difference Result 226 states and 323 transitions. [2024-11-19 00:37:58,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:37:58,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-19 00:37:58,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:58,714 INFO L225 Difference]: With dead ends: 226 [2024-11-19 00:37:58,714 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 00:37:58,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 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-19 00:37:58,716 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:58,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 452 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:58,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 00:37:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-19 00:37:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3823529411764706) internal successors, (141), 102 states have internal predecessors, (141), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:37:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-19 00:37:58,722 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 112 [2024-11-19 00:37:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:58,722 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-19 00:37:58,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:37:58,723 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-19 00:37:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:37:58,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:58,724 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:37:58,738 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-19 00:37:58,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:58,925 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:58,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:58,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1228437752, now seen corresponding path program 1 times [2024-11-19 00:37:58,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:58,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561263218] [2024-11-19 00:37:58,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:58,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:37:59,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:59,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561263218] [2024-11-19 00:37:59,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561263218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:59,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631740739] [2024-11-19 00:37:59,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:59,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:59,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:59,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:37:59,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 00:37:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:59,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:37:59,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:37:59,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:59,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631740739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:59,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:59,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-19 00:37:59,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455067383] [2024-11-19 00:37:59,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:59,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:37:59,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:59,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:37:59,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:37:59,228 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:37:59,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:59,242 INFO L93 Difference]: Finished difference Result 230 states and 327 transitions. [2024-11-19 00:37:59,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:37:59,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-19 00:37:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:59,243 INFO L225 Difference]: With dead ends: 230 [2024-11-19 00:37:59,243 INFO L226 Difference]: Without dead ends: 118 [2024-11-19 00:37:59,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 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-19 00:37:59,244 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:59,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-19 00:37:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-19 00:37:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:37:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2024-11-19 00:37:59,249 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 112 [2024-11-19 00:37:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:59,250 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2024-11-19 00:37:59,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:37:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2024-11-19 00:37:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:37:59,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:59,251 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:37:59,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 00:37:59,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:59,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:59,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:59,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1226590710, now seen corresponding path program 1 times [2024-11-19 00:37:59,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:59,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413552338] [2024-11-19 00:37:59,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:59,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:37:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:37:59,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:37:59,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413552338] [2024-11-19 00:37:59,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413552338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:59,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82696471] [2024-11-19 00:37:59,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:59,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:59,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:59,561 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:37:59,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 00:37:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:59,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:37:59,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:37:59,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82696471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:59,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:59,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-19 00:37:59,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303089644] [2024-11-19 00:37:59,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:59,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:37:59,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:37:59,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:37:59,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:37:59,749 INFO L87 Difference]: Start difference. First operand 117 states and 165 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:37:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:59,769 INFO L93 Difference]: Finished difference Result 234 states and 331 transitions. [2024-11-19 00:37:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:37:59,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-19 00:37:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:59,770 INFO L225 Difference]: With dead ends: 234 [2024-11-19 00:37:59,771 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 00:37:59,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:37:59,771 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:59,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 00:37:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-19 00:37:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:37:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2024-11-19 00:37:59,776 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 112 [2024-11-19 00:37:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:59,776 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2024-11-19 00:37:59,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:37:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2024-11-19 00:37:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:37:59,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:59,777 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:37:59,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 00:37:59,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:37:59,978 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:59,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:59,979 INFO L85 PathProgramCache]: Analyzing trace with hash 355820412, now seen corresponding path program 1 times [2024-11-19 00:37:59,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:37:59,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831646327] [2024-11-19 00:37:59,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:59,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:38:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:38:00,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:38:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:38:00,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:38:00,090 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:38:00,090 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:38:00,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:38:00,094 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:00,164 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:38:00,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:38:00 BoogieIcfgContainer [2024-11-19 00:38:00,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:38:00,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:38:00,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:38:00,167 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:38:00,167 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:37:56" (3/4) ... [2024-11-19 00:38:00,169 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:38:00,169 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:38:00,170 INFO L158 Benchmark]: Toolchain (without parser) took 4825.58ms. Allocated memory was 169.9MB in the beginning and 249.6MB in the end (delta: 79.7MB). Free memory was 116.4MB in the beginning and 133.5MB in the end (delta: -17.1MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2024-11-19 00:38:00,170 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:38:00,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.28ms. Allocated memory is still 169.9MB. Free memory was 116.0MB in the beginning and 98.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:38:00,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.29ms. Allocated memory is still 169.9MB. Free memory was 98.8MB in the beginning and 95.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:38:00,171 INFO L158 Benchmark]: Boogie Preprocessor took 72.00ms. Allocated memory is still 169.9MB. Free memory was 95.0MB in the beginning and 90.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:38:00,171 INFO L158 Benchmark]: RCFGBuilder took 650.60ms. Allocated memory was 169.9MB in the beginning and 249.6MB in the end (delta: 79.7MB). Free memory was 89.8MB in the beginning and 212.1MB in the end (delta: -122.3MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2024-11-19 00:38:00,171 INFO L158 Benchmark]: TraceAbstraction took 3725.81ms. Allocated memory is still 249.6MB. Free memory was 211.1MB in the beginning and 134.5MB in the end (delta: 76.5MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. [2024-11-19 00:38:00,171 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 249.6MB. Free memory was 134.5MB in the beginning and 133.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:38:00,172 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.09ms. Allocated memory is still 169.9MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.28ms. Allocated memory is still 169.9MB. Free memory was 116.0MB in the beginning and 98.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.29ms. Allocated memory is still 169.9MB. Free memory was 98.8MB in the beginning and 95.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.00ms. Allocated memory is still 169.9MB. Free memory was 95.0MB in the beginning and 90.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 650.60ms. Allocated memory was 169.9MB in the beginning and 249.6MB in the end (delta: 79.7MB). Free memory was 89.8MB in the beginning and 212.1MB in the end (delta: -122.3MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3725.81ms. Allocated memory is still 249.6MB. Free memory was 211.1MB in the beginning and 134.5MB in the end (delta: 76.5MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 249.6MB. Free memory was 134.5MB in the beginning and 133.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryArithmeticDOUBLEoperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someUnaryFLOAToperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L28-L30] float float_Array_0[2] = { 8.2, 1000000000.1 }; [L28-L30] float float_Array_0[2] = { 8.2, 1000000000.1 }; [L28-L30] float float_Array_0[2] = { 8.2, 1000000000.1 }; [L31-L33] signed char signed_char_Array_0[2] = { -8, 8 }; [L31-L33] signed char signed_char_Array_0[2] = { -8, 8 }; [L31-L33] signed char signed_char_Array_0[2] = { -8, 8 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -32 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -32 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 0, 2, 50 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 0, 2, 50 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 0, 2, 50 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 0, 2, 50 }; [L40] double last_1_double_Array_0_1_ = 100.5; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] CALL updateLastVariables() [L89] EXPR double_Array_0[1] [L89] last_1_double_Array_0_1_ = double_Array_0[1] [L99] RET updateLastVariables() [L100] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] double_Array_0[0] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[0] [L72] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L72] EXPR double_Array_0[0] [L72] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] double_Array_0[2] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[2] [L74] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L74] EXPR double_Array_0[2] [L74] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] double_Array_0[3] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[3] [L76] EXPR double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F [L76] EXPR double_Array_0[3] [L76] EXPR double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not((double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not((double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] double_Array_0[4] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[4] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L78] EXPR double_Array_0[4] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] float_Array_0[0] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L82] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] unsigned_short_int_Array_0[2] = __VERIFIER_nondet_ushort() [L85] EXPR unsigned_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR unsigned_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] RET updateVariables() [L101] CALL step() [L44] COND TRUE 0.625f > last_1_double_Array_0_1_ [L45] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L51] EXPR signed_char_Array_0[1] [L51] signed_char_Array_0[0] = signed_char_Array_0[1] [L52] EXPR unsigned_short_int_Array_0[2] [L52] unsigned_short_int_Array_0[1] = unsigned_short_int_Array_0[2] [L53] EXPR unsigned_short_int_Array_0[2] [L53] unsigned_short_int_Array_0[0] = unsigned_short_int_Array_0[2] [L54] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L59] EXPR float_Array_0[1] [L59] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] COND TRUE float_Array_0[1] <= float_Array_0[1] [L60] EXPR double_Array_0[2] [L60] EXPR double_Array_0[3] [L60] EXPR double_Array_0[4] [L60] double_Array_0[1] = (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])) [L63] EXPR float_Array_0[0] [L63] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L63] COND FALSE !(float_Array_0[0] > double_Array_0[1]) [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR (0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) [L92] EXPR float_Array_0[1] [L92] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) [L92] EXPR float_Array_0[0] [L92] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92-L93] return ((((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[2])) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 2569 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1641 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 928 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=6, InterpolantAutomatonStates: 23, 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, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1344 NumberOfCodeBlocks, 1344 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1221 ConstructedInterpolants, 0 QuantifiedInterpolants, 1289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2053 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 2280/2420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 00:38:00,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.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 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:38:01,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:38:02,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:38:02,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:38:02,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:38:02,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:38:02,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:38:02,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:38:02,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:38:02,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:38:02,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:38:02,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:38:02,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:38:02,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:38:02,087 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:38:02,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:38:02,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:38:02,088 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:38:02,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:38:02,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:38:02,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:38:02,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:38:02,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:38:02,093 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:38:02,093 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:38:02,094 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:38:02,094 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:38:02,094 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:38:02,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:38:02,094 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:38:02,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:38:02,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:38:02,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:38:02,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:38:02,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:38:02,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:38:02,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:38:02,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:38:02,096 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:38:02,096 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:38:02,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:38:02,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:38:02,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:38:02,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:38:02,097 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 -> 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 [2024-11-19 00:38:02,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:38:02,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:38:02,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:38:02,371 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:38:02,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:38:02,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2024-11-19 00:38:03,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:38:03,770 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:38:03,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2024-11-19 00:38:03,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f642e53db/956692be678242b284f80db3f5386b27/FLAGa11c50ea1 [2024-11-19 00:38:04,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f642e53db/956692be678242b284f80db3f5386b27 [2024-11-19 00:38:04,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:38:04,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:38:04,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:38:04,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:38:04,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:38:04,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:38:04" (1/1) ... [2024-11-19 00:38:04,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ffbf1bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04, skipping insertion in model container [2024-11-19 00:38:04,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:38:04" (1/1) ... [2024-11-19 00:38:04,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:38:04,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i[916,929] [2024-11-19 00:38:04,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:38:04,427 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:38:04,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i[916,929] [2024-11-19 00:38:04,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:38:04,506 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:38:04,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04 WrapperNode [2024-11-19 00:38:04,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:38:04,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:38:04,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:38:04,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:38:04,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04" (1/1) ... [2024-11-19 00:38:04,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04" (1/1) ... [2024-11-19 00:38:04,587 INFO L138 Inliner]: procedures = 39, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 489 [2024-11-19 00:38:04,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:38:04,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:38:04,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:38:04,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:38:04,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04" (1/1) ... [2024-11-19 00:38:04,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04" (1/1) ... [2024-11-19 00:38:04,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04" (1/1) ... [2024-11-19 00:38:04,642 INFO L175 MemorySlicer]: Split 123 memory accesses to 7 slices as follows [2, 8, 44, 29, 9, 3, 28]. 36 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 2, 1, 3]. The 16 writes are split as follows [0, 1, 6, 3, 2, 1, 3]. [2024-11-19 00:38:04,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04" (1/1) ... [2024-11-19 00:38:04,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04" (1/1) ... [2024-11-19 00:38:04,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04" (1/1) ... [2024-11-19 00:38:04,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04" (1/1) ... [2024-11-19 00:38:04,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04" (1/1) ... [2024-11-19 00:38:04,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04" (1/1) ... [2024-11-19 00:38:04,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:38:04,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:38:04,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:38:04,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:38:04,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04" (1/1) ... [2024-11-19 00:38:04,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:38:04,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:38:04,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:38:04,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:38:04,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:38:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 00:38:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 00:38:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 00:38:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 00:38:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-19 00:38:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-19 00:38:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-19 00:38:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 00:38:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 00:38:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 00:38:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 00:38:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-19 00:38:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-19 00:38:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-19 00:38:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:38:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:38:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:38:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:38:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:38:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:38:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 00:38:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 00:38:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 00:38:04,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 00:38:04,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 00:38:04,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 00:38:04,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 00:38:04,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-19 00:38:04,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:38:04,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:38:04,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:38:04,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:38:04,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:38:04,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:38:04,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 00:38:04,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:38:04,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:38:04,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:38:04,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:38:04,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:38:04,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 00:38:04,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-19 00:38:04,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:38:04,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:38:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:38:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:38:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 00:38:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-19 00:38:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-19 00:38:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 00:38:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 00:38:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 00:38:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 00:38:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-19 00:38:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-19 00:38:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-19 00:38:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:38:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:38:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:38:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:38:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:38:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 00:38:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-19 00:38:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 00:38:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 00:38:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 00:38:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 00:38:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 00:38:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-19 00:38:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-19 00:38:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:38:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:38:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:38:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:38:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 00:38:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-19 00:38:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-19 00:38:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:38:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:38:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:38:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:38:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 00:38:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-19 00:38:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-19 00:38:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:38:04,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:38:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:38:04,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:38:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:38:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:38:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:38:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:38:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:38:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:38:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 00:38:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 00:38:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 00:38:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 00:38:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 00:38:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 00:38:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-19 00:38:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-19 00:38:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:38:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:38:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:38:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:38:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:38:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-19 00:38:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-19 00:38:04,932 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:38:04,933 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:38:06,144 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-19 00:38:06,144 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:38:06,157 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:38:06,157 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:38:06,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:38:06 BoogieIcfgContainer [2024-11-19 00:38:06,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:38:06,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:38:06,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:38:06,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:38:06,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:38:04" (1/3) ... [2024-11-19 00:38:06,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ccd7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:38:06, skipping insertion in model container [2024-11-19 00:38:06,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:38:04" (2/3) ... [2024-11-19 00:38:06,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ccd7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:38:06, skipping insertion in model container [2024-11-19 00:38:06,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:38:06" (3/3) ... [2024-11-19 00:38:06,164 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-65.i [2024-11-19 00:38:06,176 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:38:06,176 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:38:06,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:38:06,233 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;@17474ec3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:38:06,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:38:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:38:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:38:06,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:06,246 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:06,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:06,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:06,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1938011596, now seen corresponding path program 1 times [2024-11-19 00:38:06,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:06,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434694805] [2024-11-19 00:38:06,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:06,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:06,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:06,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:06,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 00:38:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:06,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:38:06,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 00:38:06,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:06,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:06,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434694805] [2024-11-19 00:38:06,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434694805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:06,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:06,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:38:06,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408400390] [2024-11-19 00:38:06,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:06,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:38:06,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:06,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:38:06,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:38:06,761 INFO L87 Difference]: Start difference. First operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:38:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:06,781 INFO L93 Difference]: Finished difference Result 219 states and 337 transitions. [2024-11-19 00:38:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:38:06,783 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-19 00:38:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:06,788 INFO L225 Difference]: With dead ends: 219 [2024-11-19 00:38:06,788 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 00:38:06,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:38:06,793 INFO L432 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:06,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 00:38:06,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-19 00:38:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:38:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-19 00:38:06,829 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 112 [2024-11-19 00:38:06,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:06,830 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-19 00:38:06,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:38:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-19 00:38:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:38:06,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:06,833 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:06,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 00:38:07,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:07,035 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:07,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:07,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1962849030, now seen corresponding path program 1 times [2024-11-19 00:38:07,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:07,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918616902] [2024-11-19 00:38:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:07,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:07,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:07,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:07,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 00:38:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:07,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:38:07,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 00:38:07,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:07,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:07,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918616902] [2024-11-19 00:38:07,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918616902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:07,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:07,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:38:07,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104071602] [2024-11-19 00:38:07,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:07,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:38:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:07,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:38:07,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:38:07,524 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:38:07,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:07,586 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2024-11-19 00:38:07,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:38:07,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-19 00:38:07,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:07,589 INFO L225 Difference]: With dead ends: 217 [2024-11-19 00:38:07,590 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 00:38:07,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:38:07,591 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:07,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 00:38:07,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-19 00:38:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:38:07,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-19 00:38:07,600 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 112 [2024-11-19 00:38:07,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:07,600 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-19 00:38:07,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:38:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-19 00:38:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:38:07,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:07,603 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:07,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:38:07,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:07,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:07,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:07,808 INFO L85 PathProgramCache]: Analyzing trace with hash 611463812, now seen corresponding path program 1 times [2024-11-19 00:38:07,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:07,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569503536] [2024-11-19 00:38:07,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:07,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:07,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:07,812 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:07,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 00:38:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:08,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:38:08,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:08,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:08,355 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 62 treesize of output 20 [2024-11-19 00:38:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:38:09,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:09,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:09,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569503536] [2024-11-19 00:38:09,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569503536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:09,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:09,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:38:09,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420570204] [2024-11-19 00:38:09,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:09,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:38:09,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:09,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:38:09,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:38:09,065 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:38:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:13,848 INFO L93 Difference]: Finished difference Result 357 states and 510 transitions. [2024-11-19 00:38:13,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:38:13,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-19 00:38:13,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:13,854 INFO L225 Difference]: With dead ends: 357 [2024-11-19 00:38:13,854 INFO L226 Difference]: Without dead ends: 249 [2024-11-19 00:38:13,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:38:13,855 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 202 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:13,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 365 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-19 00:38:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-19 00:38:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 216. [2024-11-19 00:38:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 191 states have (on average 1.382198952879581) internal successors, (264), 191 states have internal predecessors, (264), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:38:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 308 transitions. [2024-11-19 00:38:13,878 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 308 transitions. Word has length 112 [2024-11-19 00:38:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:13,880 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 308 transitions. [2024-11-19 00:38:13,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:38:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 308 transitions. [2024-11-19 00:38:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:38:13,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:13,885 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:13,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 00:38:14,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:14,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:14,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:14,086 INFO L85 PathProgramCache]: Analyzing trace with hash -726119745, now seen corresponding path program 1 times [2024-11-19 00:38:14,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:14,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198248828] [2024-11-19 00:38:14,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:14,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:14,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:14,090 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:14,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 00:38:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:14,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:38:14,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:38:14,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:14,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:14,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198248828] [2024-11-19 00:38:14,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198248828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:14,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:14,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:38:14,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17463086] [2024-11-19 00:38:14,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:14,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:38:14,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:14,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:38:14,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:38:14,507 INFO L87 Difference]: Start difference. First operand 216 states and 308 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:38:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:14,552 INFO L93 Difference]: Finished difference Result 439 states and 627 transitions. [2024-11-19 00:38:14,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:38:14,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2024-11-19 00:38:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:14,554 INFO L225 Difference]: With dead ends: 439 [2024-11-19 00:38:14,554 INFO L226 Difference]: Without dead ends: 226 [2024-11-19 00:38:14,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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-19 00:38:14,555 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:14,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 592 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-19 00:38:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2024-11-19 00:38:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 199 states have (on average 1.3668341708542713) internal successors, (272), 199 states have internal predecessors, (272), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:38:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 316 transitions. [2024-11-19 00:38:14,570 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 316 transitions. Word has length 113 [2024-11-19 00:38:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:14,570 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 316 transitions. [2024-11-19 00:38:14,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:38:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 316 transitions. [2024-11-19 00:38:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:38:14,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:14,572 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:14,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 00:38:14,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:14,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:14,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:14,773 INFO L85 PathProgramCache]: Analyzing trace with hash -46061375, now seen corresponding path program 1 times [2024-11-19 00:38:14,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:14,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487118075] [2024-11-19 00:38:14,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:14,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:14,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:14,775 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:14,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 00:38:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:15,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:38:15,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:38:15,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:15,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:15,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487118075] [2024-11-19 00:38:15,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487118075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:15,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:15,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:38:15,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286193545] [2024-11-19 00:38:15,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:15,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:15,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:15,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:15,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:15,167 INFO L87 Difference]: Start difference. First operand 224 states and 316 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:38:15,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:15,223 INFO L93 Difference]: Finished difference Result 451 states and 637 transitions. [2024-11-19 00:38:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:38:15,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2024-11-19 00:38:15,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:15,226 INFO L225 Difference]: With dead ends: 451 [2024-11-19 00:38:15,226 INFO L226 Difference]: Without dead ends: 230 [2024-11-19 00:38:15,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:15,227 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:15,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 730 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-19 00:38:15,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2024-11-19 00:38:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3596059113300492) internal successors, (276), 203 states have internal predecessors, (276), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:38:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 320 transitions. [2024-11-19 00:38:15,239 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 320 transitions. Word has length 113 [2024-11-19 00:38:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:15,239 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 320 transitions. [2024-11-19 00:38:15,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:38:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 320 transitions. [2024-11-19 00:38:15,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:38:15,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:15,241 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:15,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 00:38:15,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:15,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:15,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:15,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1728945987, now seen corresponding path program 1 times [2024-11-19 00:38:15,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:15,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804085354] [2024-11-19 00:38:15,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:15,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:15,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:15,443 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:15,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 00:38:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:15,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:38:15,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:38:15,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:15,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:15,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804085354] [2024-11-19 00:38:15,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804085354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:15,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:15,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:38:15,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854398775] [2024-11-19 00:38:15,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:15,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:38:15,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:15,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:38:15,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:15,842 INFO L87 Difference]: Start difference. First operand 228 states and 320 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:38:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:15,906 INFO L93 Difference]: Finished difference Result 459 states and 645 transitions. [2024-11-19 00:38:15,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:38:15,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2024-11-19 00:38:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:15,909 INFO L225 Difference]: With dead ends: 459 [2024-11-19 00:38:15,909 INFO L226 Difference]: Without dead ends: 234 [2024-11-19 00:38:15,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:38:15,910 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:15,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 869 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:38:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-19 00:38:15,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2024-11-19 00:38:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 207 states have internal predecessors, (280), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:38:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 324 transitions. [2024-11-19 00:38:15,928 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 324 transitions. Word has length 113 [2024-11-19 00:38:15,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:15,929 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 324 transitions. [2024-11-19 00:38:15,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:38:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 324 transitions. [2024-11-19 00:38:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:38:15,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:15,931 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:15,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 00:38:16,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:16,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:16,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:16,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1730793029, now seen corresponding path program 1 times [2024-11-19 00:38:16,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:16,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697689047] [2024-11-19 00:38:16,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:16,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:16,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:16,133 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:16,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 00:38:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:16,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:38:16,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:16,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:16,579 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 155 treesize of output 65 [2024-11-19 00:38:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 00:38:16,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:16,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:16,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697689047] [2024-11-19 00:38:16,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697689047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:16,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:16,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:38:16,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928062083] [2024-11-19 00:38:16,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:16,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:16,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:16,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:16,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:16,608 INFO L87 Difference]: Start difference. First operand 232 states and 324 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:38:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:18,542 INFO L93 Difference]: Finished difference Result 461 states and 645 transitions. [2024-11-19 00:38:18,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:38:18,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2024-11-19 00:38:18,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:18,544 INFO L225 Difference]: With dead ends: 461 [2024-11-19 00:38:18,544 INFO L226 Difference]: Without dead ends: 232 [2024-11-19 00:38:18,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:18,545 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 144 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:18,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 405 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 00:38:18,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-19 00:38:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2024-11-19 00:38:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3497536945812807) internal successors, (274), 203 states have internal predecessors, (274), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:38:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 318 transitions. [2024-11-19 00:38:18,555 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 318 transitions. Word has length 113 [2024-11-19 00:38:18,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:18,555 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 318 transitions. [2024-11-19 00:38:18,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:38:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 318 transitions. [2024-11-19 00:38:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 00:38:18,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:18,556 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:18,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 00:38:18,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:18,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:18,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:18,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1230265213, now seen corresponding path program 1 times [2024-11-19 00:38:18,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:18,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567710072] [2024-11-19 00:38:18,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:18,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:18,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:18,759 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:18,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 00:38:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:19,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:38:19,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:19,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:19,258 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 154 treesize of output 64 [2024-11-19 00:38:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-19 00:38:19,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:38:19,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:19,537 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 98 treesize of output 1 [2024-11-19 00:38:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:38:19,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:19,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567710072] [2024-11-19 00:38:19,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567710072] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:38:19,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:38:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-19 00:38:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578557051] [2024-11-19 00:38:19,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:38:19,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:38:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:19,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:38:19,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:38:19,546 INFO L87 Difference]: Start difference. First operand 228 states and 318 transitions. Second operand has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 12 states have internal predecessors, (85), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-19 00:38:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:22,635 INFO L93 Difference]: Finished difference Result 479 states and 663 transitions. [2024-11-19 00:38:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:38:22,636 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 12 states have internal predecessors, (85), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 115 [2024-11-19 00:38:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:22,637 INFO L225 Difference]: With dead ends: 479 [2024-11-19 00:38:22,637 INFO L226 Difference]: Without dead ends: 232 [2024-11-19 00:38:22,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:38:22,638 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 143 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:22,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 537 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-19 00:38:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-19 00:38:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2024-11-19 00:38:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3300492610837438) internal successors, (270), 203 states have internal predecessors, (270), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:38:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 314 transitions. [2024-11-19 00:38:22,646 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 314 transitions. Word has length 115 [2024-11-19 00:38:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:22,646 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 314 transitions. [2024-11-19 00:38:22,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 12 states have internal predecessors, (85), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-19 00:38:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 314 transitions. [2024-11-19 00:38:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 00:38:22,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:22,648 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:22,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 00:38:22,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:22,849 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:22,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:22,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1158298817, now seen corresponding path program 1 times [2024-11-19 00:38:22,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:22,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610805793] [2024-11-19 00:38:22,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:22,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:22,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:22,852 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:22,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 00:38:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:23,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:38:23,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:23,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:23,330 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 173 treesize of output 65 [2024-11-19 00:38:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 00:38:23,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:23,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:23,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610805793] [2024-11-19 00:38:23,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610805793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:23,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:23,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:38:23,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286691607] [2024-11-19 00:38:23,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:23,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:23,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:23,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:23,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:23,352 INFO L87 Difference]: Start difference. First operand 228 states and 314 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:38:24,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:38:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:25,773 INFO L93 Difference]: Finished difference Result 455 states and 627 transitions. [2024-11-19 00:38:25,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:38:25,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2024-11-19 00:38:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:25,775 INFO L225 Difference]: With dead ends: 455 [2024-11-19 00:38:25,775 INFO L226 Difference]: Without dead ends: 230 [2024-11-19 00:38:25,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:25,776 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 132 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:25,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 393 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 00:38:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-19 00:38:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2024-11-19 00:38:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3201970443349753) internal successors, (268), 203 states have internal predecessors, (268), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:38:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 312 transitions. [2024-11-19 00:38:25,783 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 312 transitions. Word has length 115 [2024-11-19 00:38:25,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:25,783 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 312 transitions. [2024-11-19 00:38:25,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:38:25,783 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 312 transitions. [2024-11-19 00:38:25,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 00:38:25,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:25,784 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:25,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 00:38:25,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:25,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:25,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1359241349, now seen corresponding path program 1 times [2024-11-19 00:38:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:25,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393116702] [2024-11-19 00:38:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:25,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:25,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:25,991 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:25,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 00:38:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:26,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:38:26,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:26,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:26,521 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 175 treesize of output 67 [2024-11-19 00:38:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-19 00:38:26,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:26,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:26,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393116702] [2024-11-19 00:38:26,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393116702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:26,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:26,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:38:26,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281422064] [2024-11-19 00:38:26,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:26,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:26,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:26,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:26,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:26,543 INFO L87 Difference]: Start difference. First operand 228 states and 312 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:38:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:28,414 INFO L93 Difference]: Finished difference Result 455 states and 623 transitions. [2024-11-19 00:38:28,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:38:28,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2024-11-19 00:38:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:28,416 INFO L225 Difference]: With dead ends: 455 [2024-11-19 00:38:28,416 INFO L226 Difference]: Without dead ends: 230 [2024-11-19 00:38:28,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:28,417 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 123 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:28,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 389 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 00:38:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-19 00:38:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2024-11-19 00:38:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3103448275862069) internal successors, (266), 203 states have internal predecessors, (266), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:38:28,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 310 transitions. [2024-11-19 00:38:28,442 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 310 transitions. Word has length 117 [2024-11-19 00:38:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:28,442 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 310 transitions. [2024-11-19 00:38:28,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:38:28,442 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 310 transitions. [2024-11-19 00:38:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 00:38:28,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:28,443 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:28,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 00:38:28,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:28,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:28,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash 867926911, now seen corresponding path program 1 times [2024-11-19 00:38:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:28,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2249424] [2024-11-19 00:38:28,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:28,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:28,648 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:28,648 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-19 00:38:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:29,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:38:29,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:29,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:29,165 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 173 treesize of output 65 [2024-11-19 00:38:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 00:38:29,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:29,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:29,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2249424] [2024-11-19 00:38:29,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2249424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:29,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:29,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:38:29,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616713603] [2024-11-19 00:38:29,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:29,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:38:29,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:29,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:38:29,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:38:29,184 INFO L87 Difference]: Start difference. First operand 228 states and 310 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:38:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:38:31,105 INFO L93 Difference]: Finished difference Result 455 states and 619 transitions. [2024-11-19 00:38:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:38:31,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 119 [2024-11-19 00:38:31,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:38:31,107 INFO L225 Difference]: With dead ends: 455 [2024-11-19 00:38:31,107 INFO L226 Difference]: Without dead ends: 230 [2024-11-19 00:38:31,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:38:31,108 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 114 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:38:31,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 385 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 00:38:31,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-19 00:38:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2024-11-19 00:38:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3004926108374384) internal successors, (264), 203 states have internal predecessors, (264), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:38:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 308 transitions. [2024-11-19 00:38:31,115 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 308 transitions. Word has length 119 [2024-11-19 00:38:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:38:31,116 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 308 transitions. [2024-11-19 00:38:31,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:38:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2024-11-19 00:38:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 00:38:31,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:38:31,118 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:38:31,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 00:38:31,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:31,318 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:38:31,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:38:31,319 INFO L85 PathProgramCache]: Analyzing trace with hash -700276027, now seen corresponding path program 1 times [2024-11-19 00:38:31,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:38:31,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070171513] [2024-11-19 00:38:31,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:38:31,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:38:31,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:38:31,320 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:38:31,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 00:38:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:38:31,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 00:38:31,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:38:32,041 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 8 treesize of output 1 [2024-11-19 00:38:32,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2024-11-19 00:38:32,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:38:32,571 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 143 treesize of output 59 [2024-11-19 00:38:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 00:38:46,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:38:46,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:38:46,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070171513] [2024-11-19 00:38:46,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070171513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:38:46,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:38:46,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:38:46,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989886152] [2024-11-19 00:38:46,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:38:46,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:38:46,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:38:46,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:38:46,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=97, Unknown=3, NotChecked=0, Total=132 [2024-11-19 00:38:46,173 INFO L87 Difference]: Start difference. First operand 228 states and 308 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 11 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:38:51,406 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 [0] [2024-11-19 00:38:56,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:39:00,826 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 [0] [2024-11-19 00:39:05,611 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 [0] [2024-11-19 00:39:10,244 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 [0] [2024-11-19 00:39:14,925 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 [0] [2024-11-19 00:39:19,592 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 [0] [2024-11-19 00:39:25,017 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 [0] [2024-11-19 00:39:29,840 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 [0] [2024-11-19 00:39:36,679 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 [0]