./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-16.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1689f85c28d1e6434194d2a6f7eb0aae66aa4ed557053bab0b2942bb334560be --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:14:01,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:14:01,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:14:01,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:14:01,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:14:01,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:14:01,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:14:01,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:14:01,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:14:01,891 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:14:01,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:14:01,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:14:01,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:14:01,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:14:01,895 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:14:01,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:14:01,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:14:01,896 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:14:01,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:14:01,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:14:01,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:14:01,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:14:01,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:14:01,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:14:01,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:14:01,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:14:01,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:14:01,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:14:01,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:14:01,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:14:01,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:14:01,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:14:01,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:14:01,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:14:01,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:14:01,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:14:01,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:14:01,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:14:01,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:14:01,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:14:01,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:14:01,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:14:01,907 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-clean/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-clean/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 -> 1689f85c28d1e6434194d2a6f7eb0aae66aa4ed557053bab0b2942bb334560be [2024-10-11 13:14:02,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:14:02,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:14:02,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:14:02,232 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:14:02,232 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:14:02,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-16.i [2024-10-11 13:14:03,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:14:03,963 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:14:03,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-16.i [2024-10-11 13:14:03,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9a9fc8084/90407fff222c47cbb78f0b02280deac8/FLAG9d64d24db [2024-10-11 13:14:03,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9a9fc8084/90407fff222c47cbb78f0b02280deac8 [2024-10-11 13:14:03,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:14:03,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:14:04,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:14:04,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:14:04,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:14:04,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:14:03" (1/1) ... [2024-10-11 13:14:04,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d4e9e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04, skipping insertion in model container [2024-10-11 13:14:04,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:14:03" (1/1) ... [2024-10-11 13:14:04,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:14:04,206 WARN L248 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-16.i[916,929] [2024-10-11 13:14:04,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:14:04,275 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:14:04,288 WARN L248 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-16.i[916,929] [2024-10-11 13:14:04,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:14:04,336 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:14:04,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04 WrapperNode [2024-10-11 13:14:04,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:14:04,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:14:04,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:14:04,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:14:04,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04" (1/1) ... [2024-10-11 13:14:04,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04" (1/1) ... [2024-10-11 13:14:04,412 INFO L138 Inliner]: procedures = 29, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 468 [2024-10-11 13:14:04,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:14:04,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:14:04,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:14:04,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:14:04,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04" (1/1) ... [2024-10-11 13:14:04,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04" (1/1) ... [2024-10-11 13:14:04,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04" (1/1) ... [2024-10-11 13:14:04,457 INFO L175 MemorySlicer]: Split 124 memory accesses to 5 slices as follows [2, 19, 34, 46, 23]. 37 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 3, 5, 3]. The 17 writes are split as follows [0, 3, 3, 7, 4]. [2024-10-11 13:14:04,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04" (1/1) ... [2024-10-11 13:14:04,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04" (1/1) ... [2024-10-11 13:14:04,486 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04" (1/1) ... [2024-10-11 13:14:04,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04" (1/1) ... [2024-10-11 13:14:04,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04" (1/1) ... [2024-10-11 13:14:04,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04" (1/1) ... [2024-10-11 13:14:04,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:14:04,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:14:04,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:14:04,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:14:04,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04" (1/1) ... [2024-10-11 13:14:04,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:14:04,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:14:04,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:14:04,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:14:04,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:14:04,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:14:04,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:14:04,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:14:04,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:14:04,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:14:04,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:14:04,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:14:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:14:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:14:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:14:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:14:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:14:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:14:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:14:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:14:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:14:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:14:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:14:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:14:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:14:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:14:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:14:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:14:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:14:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:14:04,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:14:04,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:14:04,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:14:04,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:14:04,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:14:04,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:14:04,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:14:04,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:14:04,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:14:04,794 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:14:04,796 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:14:05,298 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-10-11 13:14:05,299 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:14:05,345 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:14:05,346 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:14:05,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:05 BoogieIcfgContainer [2024-10-11 13:14:05,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:14:05,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:14:05,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:14:05,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:14:05,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:14:03" (1/3) ... [2024-10-11 13:14:05,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be573d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:14:05, skipping insertion in model container [2024-10-11 13:14:05,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:04" (2/3) ... [2024-10-11 13:14:05,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be573d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:14:05, skipping insertion in model container [2024-10-11 13:14:05,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:05" (3/3) ... [2024-10-11 13:14:05,356 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-16.i [2024-10-11 13:14:05,372 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:14:05,372 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:14:05,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:14:05,442 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;@22c99210, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:14:05,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:14:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 80 states have internal predecessors, (113), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:14:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:14:05,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:05,462 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:14:05,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:05,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1708169915, now seen corresponding path program 1 times [2024-10-11 13:14:05,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:05,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855482205] [2024-10-11 13:14:05,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:05,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:14:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:14:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:14:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:14:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:14:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:14:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:14:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:14:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:14:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:14:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:14:05,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:05,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855482205] [2024-10-11 13:14:05,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855482205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:05,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:05,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:14:05,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564653] [2024-10-11 13:14:05,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:05,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:14:05,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:05,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:14:05,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:14:05,965 INFO L87 Difference]: Start difference. First operand has 103 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 80 states have internal predecessors, (113), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:14:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:06,010 INFO L93 Difference]: Finished difference Result 203 states and 329 transitions. [2024-10-11 13:14:06,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:14:06,013 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 152 [2024-10-11 13:14:06,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:06,023 INFO L225 Difference]: With dead ends: 203 [2024-10-11 13:14:06,024 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 13:14:06,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-10-11 13:14:06,031 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:06,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:14:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 13:14:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 13:14:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:14:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2024-10-11 13:14:06,078 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 152 [2024-10-11 13:14:06,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:06,079 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2024-10-11 13:14:06,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:14:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2024-10-11 13:14:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:14:06,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:06,087 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:14:06,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:14:06,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:06,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:06,092 INFO L85 PathProgramCache]: Analyzing trace with hash -462829281, now seen corresponding path program 1 times [2024-10-11 13:14:06,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:06,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422696643] [2024-10-11 13:14:06,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:06,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:14:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:14:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:14:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:14:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:14:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:14:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:14:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:14:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:14:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:14:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:14:07,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:07,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422696643] [2024-10-11 13:14:07,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422696643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:07,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:07,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:14:07,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781665033] [2024-10-11 13:14:07,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:07,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:14:07,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:07,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:14:07,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:14:07,399 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 7 states, 5 states have (on average 10.0) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 13:14:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:07,721 INFO L93 Difference]: Finished difference Result 288 states and 428 transitions. [2024-10-11 13:14:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:07,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.0) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) Word has length 152 [2024-10-11 13:14:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:07,725 INFO L225 Difference]: With dead ends: 288 [2024-10-11 13:14:07,725 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 13:14:07,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:14:07,732 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 121 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:07,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 685 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:07,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 13:14:07,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2024-10-11 13:14:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.3972602739726028) internal successors, (204), 147 states have internal predecessors, (204), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:14:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 276 transitions. [2024-10-11 13:14:07,772 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 276 transitions. Word has length 152 [2024-10-11 13:14:07,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:07,773 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 276 transitions. [2024-10-11 13:14:07,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.0) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 13:14:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 276 transitions. [2024-10-11 13:14:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:14:07,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:07,779 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:14:07,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:14:07,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:07,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash 238235297, now seen corresponding path program 1 times [2024-10-11 13:14:07,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:07,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117792542] [2024-10-11 13:14:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:07,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:14:07,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [677672984] [2024-10-11 13:14:07,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:07,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:14:07,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:14:07,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:14:07,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:14:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:14:08,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:14:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:14:08,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:14:08,541 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:14:08,542 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:14:08,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:14:08,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:14:08,749 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 13:14:08,855 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:14:08,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:14:08 BoogieIcfgContainer [2024-10-11 13:14:08,860 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:14:08,860 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:14:08,860 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:14:08,861 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:14:08,861 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:05" (3/4) ... [2024-10-11 13:14:08,863 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:14:08,864 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:14:08,868 INFO L158 Benchmark]: Toolchain (without parser) took 4868.09ms. Allocated memory was 192.9MB in the beginning and 237.0MB in the end (delta: 44.0MB). Free memory was 142.1MB in the beginning and 137.7MB in the end (delta: 4.4MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2024-10-11 13:14:08,868 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 100.7MB. Free memory was 64.8MB in the beginning and 64.7MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:14:08,868 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.17ms. Allocated memory is still 192.9MB. Free memory was 142.1MB in the beginning and 126.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:14:08,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.77ms. Allocated memory is still 192.9MB. Free memory was 126.6MB in the beginning and 122.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:14:08,869 INFO L158 Benchmark]: Boogie Preprocessor took 84.82ms. Allocated memory is still 192.9MB. Free memory was 122.4MB in the beginning and 118.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:14:08,869 INFO L158 Benchmark]: RCFGBuilder took 844.53ms. Allocated memory is still 192.9MB. Free memory was 118.2MB in the beginning and 128.7MB in the end (delta: -10.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 13:14:08,870 INFO L158 Benchmark]: TraceAbstraction took 3510.55ms. Allocated memory was 192.9MB in the beginning and 237.0MB in the end (delta: 44.0MB). Free memory was 127.7MB in the beginning and 137.7MB in the end (delta: -10.0MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2024-10-11 13:14:08,870 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 237.0MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:14:08,875 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 100.7MB. Free memory was 64.8MB in the beginning and 64.7MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.17ms. Allocated memory is still 192.9MB. Free memory was 142.1MB in the beginning and 126.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.77ms. Allocated memory is still 192.9MB. Free memory was 126.6MB in the beginning and 122.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.82ms. Allocated memory is still 192.9MB. Free memory was 122.4MB in the beginning and 118.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 844.53ms. Allocated memory is still 192.9MB. Free memory was 118.2MB in the beginning and 128.7MB in the end (delta: -10.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3510.55ms. Allocated memory was 192.9MB in the beginning and 237.0MB in the end (delta: 44.0MB). Free memory was 127.7MB in the beginning and 137.7MB in the end (delta: -10.0MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 237.0MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 1 }; [L25-L27] float float_Array_0[3] = { 3.8, 2.75, 1000000.8 }; [L25-L27] float float_Array_0[3] = { 3.8, 2.75, 1000000.8 }; [L25-L27] float float_Array_0[3] = { 3.8, 2.75, 1000000.8 }; [L25-L27] float float_Array_0[3] = { 3.8, 2.75, 1000000.8 }; [L28-L30] signed char signed_char_Array_0[5] = { 32, 25, 2, 0, 2 }; [L28-L30] signed char signed_char_Array_0[5] = { 32, 25, 2, 0, 2 }; [L28-L30] signed char signed_char_Array_0[5] = { 32, 25, 2, 0, 2 }; [L28-L30] signed char signed_char_Array_0[5] = { 32, 25, 2, 0, 2 }; [L28-L30] signed char signed_char_Array_0[5] = { 32, 25, 2, 0, 2 }; [L28-L30] signed char signed_char_Array_0[5] = { 32, 25, 2, 0, 2 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { -32, 256, 4 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { -32, 256, 4 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { -32, 256, 4 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { -32, 256, 4 }; [L34] signed char last_1_signed_char_Array_0_1_ = 25; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR signed_char_Array_0[1] [L98] last_1_signed_char_Array_0_1_ = signed_char_Array_0[1] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L71] float_Array_0[0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L72] 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}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L72] 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}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L72] 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L72] 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}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L73] float_Array_0[1] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(float_Array_0[1] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] RET assume_abort_if_not(float_Array_0[1] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[0] >= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[0] >= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[2] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[2] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] signed_char_Array_0[4] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[4] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[4] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L89] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L92] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L93] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] RET assume_abort_if_not(signed_short_int_Array_0[2] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L95] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L95] CALL assume_abort_if_not(signed_short_int_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L95] RET assume_abort_if_not(signed_short_int_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] RET updateVariables() [L110] CALL step() [L38] EXPR signed_short_int_Array_0[2] [L38] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L38] EXPR ((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1]) [L38] EXPR signed_short_int_Array_0[1] [L38] EXPR ((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L38] COND FALSE !((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) [L41] EXPR float_Array_0[0] [L41] float_Array_0[2] = float_Array_0[0] [L42] EXPR signed_char_Array_0[3] [L42] signed char stepLocal_2 = signed_char_Array_0[3]; [L43] EXPR float_Array_0[1] [L43] unsigned char stepLocal_1 = 99999.375 <= float_Array_0[1]; [L44] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L44] COND FALSE !(signed_char_Array_0[2] <= stepLocal_2) [L49] signed_short_int_Array_0[0] = -25 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L51] EXPR BOOL_unsigned_char_Array_0[0] [L51] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L52] EXPR float_Array_0[0] [L52] EXPR float_Array_0[2] [L52] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L52] COND FALSE !(float_Array_0[0] < (float_Array_0[2] / float_Array_0[1])) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR signed_short_int_Array_0[2] [L101] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1]) [L101] EXPR signed_short_int_Array_0[1] [L101] EXPR ((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1 [L101] EXPR ((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0])) [L101] EXPR float_Array_0[2] [L101] EXPR float_Array_0[0] [L101] EXPR (((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0]))) && ((float_Array_0[0] < (float_Array_0[2] / float_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) ((((((signed_char_Array_0[3]) > (5)) ? (signed_char_Array_0[3]) : (5))) + (signed_char_Array_0[0] - signed_char_Array_0[2])) - signed_char_Array_0[4]))) : ((float_Array_0[1] > float_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[3])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0]))) && ((float_Array_0[0] < (float_Array_0[2] / float_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) ((((((signed_char_Array_0[3]) > (5)) ? (signed_char_Array_0[3]) : (5))) + (signed_char_Array_0[0] - signed_char_Array_0[2])) - signed_char_Array_0[4]))) : ((float_Array_0[1] > float_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[3])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0]))) && ((float_Array_0[0] < (float_Array_0[2] / float_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) ((((((signed_char_Array_0[3]) > (5)) ? (signed_char_Array_0[3]) : (5))) + (signed_char_Array_0[0] - signed_char_Array_0[2])) - signed_char_Array_0[4]))) : ((float_Array_0[1] > float_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[3])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])))) : 1)) && ((signed_char_Array_0[2] <= signed_char_Array_0[3]) ? (((float_Array_0[0] < float_Array_0[2]) && (99999.375 <= float_Array_0[1])) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[2] + signed_char_Array_0[4]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) -25))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0]))) && ((float_Array_0[0] < (float_Array_0[2] / float_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) ((((((signed_char_Array_0[3]) > (5)) ? (signed_char_Array_0[3]) : (5))) + (signed_char_Array_0[0] - signed_char_Array_0[2])) - signed_char_Array_0[4]))) : ((float_Array_0[1] > float_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[3])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])))) : 1)) && ((signed_char_Array_0[2] <= signed_char_Array_0[3]) ? (((float_Array_0[0] < float_Array_0[2]) && (99999.375 <= float_Array_0[1])) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[2] + signed_char_Array_0[4]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) -25))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101-L102] return (((((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0]))) && ((float_Array_0[0] < (float_Array_0[2] / float_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) ((((((signed_char_Array_0[3]) > (5)) ? (signed_char_Array_0[3]) : (5))) + (signed_char_Array_0[0] - signed_char_Array_0[2])) - signed_char_Array_0[4]))) : ((float_Array_0[1] > float_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[3])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])))) : 1)) && ((signed_char_Array_0[2] <= signed_char_Array_0[3]) ? (((float_Array_0[0] < float_Array_0[2]) && (99999.375 <= float_Array_0[1])) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[2] + signed_char_Array_0[4]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) -25))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 831 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 550 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 212 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 281 mSDtfsCounter, 212 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=2, InterpolantAutomatonStates: 9, 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, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 608 NumberOfCodeBlocks, 608 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 422 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1680/1680 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-10-11 13:14:08,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-16.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1689f85c28d1e6434194d2a6f7eb0aae66aa4ed557053bab0b2942bb334560be --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:14:11,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:14:11,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:14:11,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:14:11,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:14:11,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:14:11,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:14:11,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:14:11,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:14:11,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:14:11,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:14:11,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:14:11,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:14:11,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:14:11,286 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:14:11,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:14:11,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:14:11,287 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:14:11,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:14:11,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:14:11,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:14:11,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:14:11,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:14:11,290 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:14:11,291 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:14:11,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:14:11,291 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:14:11,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:14:11,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:14:11,292 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:14:11,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:14:11,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:14:11,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:14:11,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:14:11,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:14:11,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:14:11,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:14:11,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:14:11,295 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:14:11,295 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:14:11,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:14:11,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:14:11,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:14:11,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:14:11,297 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:14:11,297 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-clean/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-clean/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 -> 1689f85c28d1e6434194d2a6f7eb0aae66aa4ed557053bab0b2942bb334560be [2024-10-11 13:14:11,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:14:11,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:14:11,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:14:11,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:14:11,683 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:14:11,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-16.i [2024-10-11 13:14:13,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:14:13,524 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:14:13,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-16.i [2024-10-11 13:14:13,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/49dfa6f2b/4b5eeb7544e3494488d2192a490645da/FLAGd163445b1 [2024-10-11 13:14:13,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/49dfa6f2b/4b5eeb7544e3494488d2192a490645da [2024-10-11 13:14:13,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:14:13,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:14:13,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:14:13,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:14:13,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:14:13,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:14:13" (1/1) ... [2024-10-11 13:14:13,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508d0cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13, skipping insertion in model container [2024-10-11 13:14:13,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:14:13" (1/1) ... [2024-10-11 13:14:13,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:14:13,797 WARN L248 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-16.i[916,929] [2024-10-11 13:14:13,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:14:13,901 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:14:13,912 WARN L248 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-16.i[916,929] [2024-10-11 13:14:13,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:14:13,984 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:14:13,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13 WrapperNode [2024-10-11 13:14:13,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:14:13,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:14:13,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:14:13,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:14:13,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13" (1/1) ... [2024-10-11 13:14:14,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13" (1/1) ... [2024-10-11 13:14:14,066 INFO L138 Inliner]: procedures = 33, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2024-10-11 13:14:14,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:14:14,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:14:14,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:14:14,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:14:14,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13" (1/1) ... [2024-10-11 13:14:14,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13" (1/1) ... [2024-10-11 13:14:14,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13" (1/1) ... [2024-10-11 13:14:14,126 INFO L175 MemorySlicer]: Split 124 memory accesses to 5 slices as follows [2, 19, 34, 46, 23]. 37 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 3, 5, 3]. The 17 writes are split as follows [0, 3, 3, 7, 4]. [2024-10-11 13:14:14,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13" (1/1) ... [2024-10-11 13:14:14,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13" (1/1) ... [2024-10-11 13:14:14,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13" (1/1) ... [2024-10-11 13:14:14,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13" (1/1) ... [2024-10-11 13:14:14,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13" (1/1) ... [2024-10-11 13:14:14,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13" (1/1) ... [2024-10-11 13:14:14,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:14:14,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:14:14,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:14:14,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:14:14,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13" (1/1) ... [2024-10-11 13:14:14,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:14:14,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:14:14,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:14:14,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:14:14,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:14:14,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:14:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:14:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:14:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:14:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:14:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:14:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:14:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:14:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:14:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:14:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:14:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:14:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:14:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:14:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:14:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:14:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:14:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:14:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:14:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:14:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:14:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:14:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:14:14,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:14:14,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:14:14,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:14:14,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:14:14,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:14:14,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:14:14,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:14:14,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:14:14,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:14:14,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:14:14,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:14:14,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:14:14,277 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:14:14,277 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:14:14,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:14:14,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:14:14,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:14:14,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:14:14,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:14:14,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:14:14,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:14:14,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:14:14,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:14:14,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:14:14,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:14:14,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:14:14,420 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:14:14,422 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:14:17,515 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2024-10-11 13:14:17,515 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:14:17,594 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:14:17,595 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:14:17,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:17 BoogieIcfgContainer [2024-10-11 13:14:17,596 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:14:17,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:14:17,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:14:17,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:14:17,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:14:13" (1/3) ... [2024-10-11 13:14:17,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5baa6e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:14:17, skipping insertion in model container [2024-10-11 13:14:17,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:13" (2/3) ... [2024-10-11 13:14:17,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5baa6e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:14:17, skipping insertion in model container [2024-10-11 13:14:17,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:17" (3/3) ... [2024-10-11 13:14:17,608 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-16.i [2024-10-11 13:14:17,624 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:14:17,625 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:14:17,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:14:17,699 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;@3543f70a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:14:17,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:14:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 80 states have internal predecessors, (113), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:14:17,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:14:17,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:17,718 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:14:17,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:17,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:17,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1708169915, now seen corresponding path program 1 times [2024-10-11 13:14:17,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:17,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583134529] [2024-10-11 13:14:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:17,735 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-10-11 13:14:17,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:17,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 13:14:17,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:14:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:14:18,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-10-11 13:14:18,333 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:18,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:18,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583134529] [2024-10-11 13:14:18,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583134529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:18,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:18,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:14:18,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799379160] [2024-10-11 13:14:18,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:18,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:14:18,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:18,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:14:18,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:14:18,370 INFO L87 Difference]: Start difference. First operand has 103 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 80 states have internal predecessors, (113), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:14:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:18,437 INFO L93 Difference]: Finished difference Result 199 states and 323 transitions. [2024-10-11 13:14:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:14:18,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 152 [2024-10-11 13:14:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:18,460 INFO L225 Difference]: With dead ends: 199 [2024-10-11 13:14:18,464 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 13:14:18,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-10-11 13:14:18,476 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:18,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:14:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 13:14:18,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-11 13:14:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 74 states have internal predecessors, (100), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:14:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2024-10-11 13:14:18,532 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 152 [2024-10-11 13:14:18,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:18,533 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2024-10-11 13:14:18,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:14:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2024-10-11 13:14:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:14:18,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:18,536 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:14:18,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:14:18,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 13:14:18,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:18,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:18,739 INFO L85 PathProgramCache]: Analyzing trace with hash -462829281, now seen corresponding path program 1 times [2024-10-11 13:14:18,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:18,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291188423] [2024-10-11 13:14:18,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:18,740 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-10-11 13:14:18,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:18,748 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 13:14:18,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:14:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:19,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 13:14:19,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:19,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:14:20,270 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 68 treesize of output 32 [2024-10-11 13:14:21,560 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-10-11 13:14:21,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:21,855 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 191 treesize of output 77 [2024-10-11 13:14:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2024-10-11 13:14:21,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:22,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:22,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291188423] [2024-10-11 13:14:22,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291188423] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:22,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2041396720] [2024-10-11 13:14:22,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:22,289 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:14:22,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:14:22,291 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:14:22,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 13:14:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 13:14:24,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:24,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:14:25,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-10-11 13:14:31,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:31,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 90 [2024-10-11 13:14:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2024-10-11 13:14:32,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:32,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2041396720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:32,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:14:32,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 20 [2024-10-11 13:14:32,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072869330] [2024-10-11 13:14:32,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:32,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:14:32,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:32,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:14:32,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:14:32,276 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 13:14:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:42,646 INFO L93 Difference]: Finished difference Result 376 states and 547 transitions. [2024-10-11 13:14:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 13:14:42,649 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 152 [2024-10-11 13:14:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:42,655 INFO L225 Difference]: With dead ends: 376 [2024-10-11 13:14:42,657 INFO L226 Difference]: Without dead ends: 280 [2024-10-11 13:14:42,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:14:42,662 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 431 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:42,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 787 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2024-10-11 13:14:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-11 13:14:42,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 274. [2024-10-11 13:14:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 207 states have (on average 1.3381642512077294) internal successors, (277), 209 states have internal predecessors, (277), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 13:14:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 401 transitions. [2024-10-11 13:14:42,722 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 401 transitions. Word has length 152 [2024-10-11 13:14:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:42,723 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 401 transitions. [2024-10-11 13:14:42,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 13:14:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 401 transitions. [2024-10-11 13:14:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:14:42,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:42,728 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:14:42,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:14:42,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-10-11 13:14:43,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:14:43,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:43,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:43,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2110135329, now seen corresponding path program 1 times [2024-10-11 13:14:43,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:43,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900730284] [2024-10-11 13:14:43,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:43,134 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-10-11 13:14:43,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:43,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 13:14:43,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:14:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:43,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:14:43,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2024-10-11 13:14:43,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:43,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:43,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900730284] [2024-10-11 13:14:43,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900730284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:43,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:43,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:14:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337439405] [2024-10-11 13:14:43,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:43,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:14:43,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:43,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:14:43,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:43,588 INFO L87 Difference]: Start difference. First operand 274 states and 401 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:14:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:43,684 INFO L93 Difference]: Finished difference Result 549 states and 804 transitions. [2024-10-11 13:14:43,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:14:43,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 152 [2024-10-11 13:14:43,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:43,692 INFO L225 Difference]: With dead ends: 549 [2024-10-11 13:14:43,692 INFO L226 Difference]: Without dead ends: 276 [2024-10-11 13:14:43,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 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-10-11 13:14:43,697 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:43,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 404 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:14:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-11 13:14:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-10-11 13:14:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 211 states have internal predecessors, (278), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 13:14:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 402 transitions. [2024-10-11 13:14:43,750 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 402 transitions. Word has length 152 [2024-10-11 13:14:43,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:43,751 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 402 transitions. [2024-10-11 13:14:43,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:14:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 402 transitions. [2024-10-11 13:14:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:14:43,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:43,760 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:14:43,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:14:43,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-11 13:14:43,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:43,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:43,961 INFO L85 PathProgramCache]: Analyzing trace with hash -892487587, now seen corresponding path program 1 times [2024-10-11 13:14:43,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:43,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155615341] [2024-10-11 13:14:43,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:43,962 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-10-11 13:14:43,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:43,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-11 13:14:43,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:14:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:44,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:14:44,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2024-10-11 13:14:44,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:44,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:44,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155615341] [2024-10-11 13:14:44,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155615341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:44,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:44,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:14:44,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982720301] [2024-10-11 13:14:44,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:44,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:14:44,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:44,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:14:44,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:44,447 INFO L87 Difference]: Start difference. First operand 276 states and 402 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:14:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:44,554 INFO L93 Difference]: Finished difference Result 551 states and 803 transitions. [2024-10-11 13:14:44,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:14:44,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 152 [2024-10-11 13:14:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:44,557 INFO L225 Difference]: With dead ends: 551 [2024-10-11 13:14:44,557 INFO L226 Difference]: Without dead ends: 276 [2024-10-11 13:14:44,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 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-10-11 13:14:44,559 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:44,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 404 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:14:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-11 13:14:44,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-10-11 13:14:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 209 states have (on average 1.325358851674641) internal successors, (277), 211 states have internal predecessors, (277), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 13:14:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 401 transitions. [2024-10-11 13:14:44,585 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 401 transitions. Word has length 152 [2024-10-11 13:14:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:44,585 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 401 transitions. [2024-10-11 13:14:44,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:14:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 401 transitions. [2024-10-11 13:14:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 13:14:44,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:44,588 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:14:44,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:14:44,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-11 13:14:44,789 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:44,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:44,790 INFO L85 PathProgramCache]: Analyzing trace with hash 875294373, now seen corresponding path program 1 times [2024-10-11 13:14:44,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:44,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940140807] [2024-10-11 13:14:44,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:44,791 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-10-11 13:14:44,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:44,794 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-11 13:14:44,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:14:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:45,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 13:14:45,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:45,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:14:45,911 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 68 treesize of output 32 [2024-10-11 13:14:47,189 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-10-11 13:14:47,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:47,395 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 191 treesize of output 77 [2024-10-11 13:14:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2024-10-11 13:14:47,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:47,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:47,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940140807] [2024-10-11 13:14:47,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940140807] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:47,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1277143867] [2024-10-11 13:14:47,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:47,667 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:14:47,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:14:47,668 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:14:47,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-11 13:14:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:50,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 13:14:50,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:50,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:14:51,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-10-11 13:14:54,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:54,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 77 [2024-10-11 13:14:54,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:54,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 88 [2024-10-11 13:14:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 31 proven. 365 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-10-11 13:14:54,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:54,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1277143867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:54,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:14:54,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 21 [2024-10-11 13:14:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664144919] [2024-10-11 13:14:54,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:14:54,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 13:14:54,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:54,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 13:14:54,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:14:54,859 INFO L87 Difference]: Start difference. First operand 276 states and 401 transitions. Second operand has 22 states, 21 states have (on average 5.190476190476191) internal successors, (109), 20 states have internal predecessors, (109), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 6 states have call successors, (42) [2024-10-11 13:14:59,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:15:01,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:15:03,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:15:09,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:15:11,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:15:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:13,266 INFO L93 Difference]: Finished difference Result 665 states and 953 transitions. [2024-10-11 13:15:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 13:15:13,270 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.190476190476191) internal successors, (109), 20 states have internal predecessors, (109), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 6 states have call successors, (42) Word has length 154 [2024-10-11 13:15:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:13,274 INFO L225 Difference]: With dead ends: 665 [2024-10-11 13:15:13,274 INFO L226 Difference]: Without dead ends: 390 [2024-10-11 13:15:13,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=405, Invalid=1757, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 13:15:13,276 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 620 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:13,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1132 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 16.1s Time] [2024-10-11 13:15:13,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-11 13:15:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 276. [2024-10-11 13:15:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 196 states have (on average 1.2653061224489797) internal successors, (248), 198 states have internal predecessors, (248), 74 states have call successors, (74), 5 states have call predecessors, (74), 5 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-11 13:15:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 396 transitions. [2024-10-11 13:15:13,299 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 396 transitions. Word has length 154 [2024-10-11 13:15:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:13,300 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 396 transitions. [2024-10-11 13:15:13,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.190476190476191) internal successors, (109), 20 states have internal predecessors, (109), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 6 states have call successors, (42) [2024-10-11 13:15:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 396 transitions. [2024-10-11 13:15:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 13:15:13,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:13,303 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:15:13,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:15:13,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-10-11 13:15:13,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:15:13,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:13,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:13,705 INFO L85 PathProgramCache]: Analyzing trace with hash 65947747, now seen corresponding path program 1 times [2024-10-11 13:15:13,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:13,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312586813] [2024-10-11 13:15:13,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:13,706 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-10-11 13:15:13,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:13,707 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-10-11 13:15:13,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:15:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:14,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:15:14,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:15:14,151 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:15:14,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:15:14,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312586813] [2024-10-11 13:15:14,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312586813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:14,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:14,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:15:14,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376370295] [2024-10-11 13:15:14,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:14,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:15:14,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:15:14,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:15:14,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:15:14,154 INFO L87 Difference]: Start difference. First operand 276 states and 396 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:15:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:14,211 INFO L93 Difference]: Finished difference Result 549 states and 788 transitions. [2024-10-11 13:15:14,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:15:14,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 154 [2024-10-11 13:15:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:14,218 INFO L225 Difference]: With dead ends: 549 [2024-10-11 13:15:14,219 INFO L226 Difference]: Without dead ends: 274 [2024-10-11 13:15:14,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 151 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-10-11 13:15:14,221 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:14,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 401 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:15:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-11 13:15:14,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-10-11 13:15:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 194 states have (on average 1.2525773195876289) internal successors, (243), 196 states have internal predecessors, (243), 74 states have call successors, (74), 5 states have call predecessors, (74), 5 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-11 13:15:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 391 transitions. [2024-10-11 13:15:14,243 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 391 transitions. Word has length 154 [2024-10-11 13:15:14,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:14,245 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 391 transitions. [2024-10-11 13:15:14,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:15:14,245 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 391 transitions. [2024-10-11 13:15:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 13:15:14,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:14,248 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:15:14,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-11 13:15:14,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-10-11 13:15:14,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:14,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:14,449 INFO L85 PathProgramCache]: Analyzing trace with hash -298536485, now seen corresponding path program 1 times [2024-10-11 13:15:14,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:14,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098965064] [2024-10-11 13:15:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:14,450 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-10-11 13:15:14,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:14,452 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-10-11 13:15:14,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:15:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:14,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:15:14,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-10-11 13:15:14,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:15:14,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:15:14,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098965064] [2024-10-11 13:15:14,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098965064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:14,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:15:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439345938] [2024-10-11 13:15:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:14,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:15:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:15:14,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:15:14,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:15:14,909 INFO L87 Difference]: Start difference. First operand 274 states and 391 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 13:15:15,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:15,401 INFO L93 Difference]: Finished difference Result 559 states and 794 transitions. [2024-10-11 13:15:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:15:15,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 154 [2024-10-11 13:15:15,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:15,404 INFO L225 Difference]: With dead ends: 559 [2024-10-11 13:15:15,405 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 13:15:15,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:15:15,407 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:15,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:15:15,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 13:15:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2024-10-11 13:15:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 194 states have (on average 1.2474226804123711) internal successors, (242), 196 states have internal predecessors, (242), 74 states have call successors, (74), 5 states have call predecessors, (74), 5 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-11 13:15:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 390 transitions. [2024-10-11 13:15:15,432 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 390 transitions. Word has length 154 [2024-10-11 13:15:15,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:15,432 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 390 transitions. [2024-10-11 13:15:15,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 13:15:15,433 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 390 transitions. [2024-10-11 13:15:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 13:15:15,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:15,436 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:15:15,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:15:15,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-10-11 13:15:15,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:15,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash 408060121, now seen corresponding path program 1 times [2024-10-11 13:15:15,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:15,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694308003] [2024-10-11 13:15:15,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:15,638 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-10-11 13:15:15,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:15,639 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-10-11 13:15:15,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:15:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:16,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 13:15:16,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:16,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:15:16,878 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 66 treesize of output 30 [2024-10-11 13:15:18,115 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 111 treesize of output 63 [2024-10-11 13:15:18,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:15:18,333 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 189 treesize of output 75 [2024-10-11 13:15:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 16 proven. 320 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2024-10-11 13:15:18,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:15:18,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:15:18,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694308003] [2024-10-11 13:15:18,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694308003] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:15:18,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1067278945] [2024-10-11 13:15:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:18,582 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:15:18,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:15:18,583 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:15:18,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-10-11 13:15:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:20,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 13:15:20,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:21,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:15:22,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-10-11 13:15:25,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:15:25,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 76 [2024-10-11 13:15:25,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:15:25,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 87 [2024-10-11 13:15:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 16 proven. 320 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2024-10-11 13:15:25,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:15:26,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1067278945] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:15:26,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:15:26,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 24 [2024-10-11 13:15:26,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171191272] [2024-10-11 13:15:26,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:15:26,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 13:15:26,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:15:26,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 13:15:26,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2024-10-11 13:15:26,075 INFO L87 Difference]: Start difference. First operand 274 states and 390 transitions. Second operand has 25 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 6 states have call successors, (42) [2024-10-11 13:15:30,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []